16 research outputs found

    A note on Gabor frames in finite dimensions

    Full text link
    The purpose of this note is to present a proof of the existence of Gabor frames in general linear position in all finite dimensions. The tools developed in this note are also helpful towards an explicit construction of such a frame, which is carried out in the last section. This result has applications in signal recovery through erasure channels, operator identification, and time-frequency analysis.Comment: 10 page

    A linear programming approach to Fuglede's conjecture in Zp3\mathbb{Z}_p^3

    Full text link
    We present an approach to Fuglede's conjecture in Zp3\mathbb{Z}_p^3 using linear programming bounds, obtaining the following partial result: if A⊆Zp3A\subseteq\mathbb{Z}_p^3 with p2−pp+p<∣A∣<p2p^2-p\sqrt{p}+\sqrt{p}<|A|<p^2, then AA is not spectral.Comment: 13 page

    On the structure of spectral and tiling subsets of cyclic groups

    Full text link
    The purpose of this paper is to investigate the properties of spectral and tiling subsets of cyclic groups, with an eye towards the spectral set conjecture in one dimension, which states that a bounded measurable subset of R\mathbb{R} accepts an orthogonal basis of exponentials if and only if it tiles R\mathbb{R} by translations. This conjecture is strongly connected to its discrete counterpart, namely that in every finite cyclic group, a subset is spectral if and only if it is a tile. The tools presented herein are refinements of recent ones used in the setting of cyclic groups; the structure of vanishing sums of roots of unity is a prevalent notion throughout the text, as well as the structure of tiling subsets of integers. We manage to prove the conjecture for cyclic groups of order pmqnp^mq^n, when one of the exponents is ≤6\leq6 or when pm−2<q4p^{m-2}<q^4, and also prove that a tiling subset of a cyclic group of order p1mp2⋯pnp_1^mp_2\dotsm p_n is spectral.Comment: 35 pages; removed one incorrect reference from version

    Polyhedral Gauss Sums, and polytopes with symmetry

    Full text link
    We define certain natural finite sums of nn'th roots of unity, called GP(n)G_P(n), that are associated to each convex integer polytope PP, and which generalize the classical 11-dimensional Gauss sum G(n)G(n) defined over Z/nZ\mathbb Z/ {n \mathbb Z}, to higher dimensional abelian groups and integer polytopes. We consider the finite Weyl group W\mathcal{W}, generated by the reflections with respect to the coordinate hyperplanes, as well as all permutations of the coordinates; further, we let G\mathcal G be the group generated by W\mathcal{W} as well as all integer translations in Zd\mathbb Z^d. We prove that if PP multi-tiles Rd\mathbb R^d under the action of G\mathcal G, then we have the closed form GP(n)=vol(P)G(n)dG_P(n) = \text{vol}(P) G(n)^d. Conversely, we also prove that if PP is a lattice tetrahedron in R3\mathbb R^3, of volume 1/61/6, such that GP(n)=vol(P)G(n)dG_P(n) = \text{vol}(P) G(n)^d, for n∈{1,2,3,4}n \in \{ 1,2,3,4 \}, then there is an element gg in G\mathcal G such that g(P)g(P) is the fundamental tetrahedron with vertices (0,0,0)(0,0,0), (1,0,0)(1, 0, 0), (1,1,0)(1,1,0), (1,1,1)(1,1,1).Comment: 18 pages, 2 figure

    Computing the covering radius of a polytope with an application to lonely runners

    Get PDF
    We are concerned with the computational problem of determining the covering radius of a rational polytope. This parameter is defined as the minimal dilation factor that is needed for the lattice translates of the correspondingly dilated polytope to cover the whole space. As our main result, we describe a new algorithm for this problem, which is simpler, more efficient and easier to implement than the only prior algorithm of Kannan (1992). Motivated by a variant of the famous Lonely Runner Conjecture, we use its geometric interpretation in terms of covering radii of zonotopes, and apply our algorithm to prove the first open case of three runners with individual starting points.Comment: 22 pages, 4 tables, 2 figures, revised versio

    On the discrete Fuglede and Pompeiu problems

    Get PDF
    We investigate the discrete Fuglede's conjecture and Pompeiu problem on finite abelian groups and develop a strong connection between the two problems. We give a geometric condition under which a multiset of a finite abelian group has the discrete Pompeiu property. Using this description and the revealed connection we prove that Fuglede's conjecture holds for Zpnq2\mathbb{Z}_{p^n q^2}, where pp and qq are different primes. In particular, we show that every spectral subset of Zpnq2\mathbb{Z}_{p^n q^2} tiles the group. Further, using our combinatorial methods we give a simple proof for the statement that Fuglede's conjecture holds for Zp2\mathbb{Z}_p^2.Comment: 24 pages. Incorporated referees' and editor's remarks. Corrected typo
    corecore