WorksMathematics
Half-line density and the structure of crystalline measures
Abstract
Let µ be a crystalline measure on the real line. Both µand its Fourier transform are locally finite sums of point masses. We prove that µ is a finite sum of translated and modulated lattice Dirac combs if and only if its support and its spectrum each have finite lower linear density on at least one half-line. The two half-lines and the sequences of radii may be chosen independently. If the support of a nonzero measure has lower half-line density d<∞, then d is the infimum of the frequency widths of the nonzero exponential polynomials vanishing on the support. In particular, the number of atoms per unit interval is uniformly bounded. If µ is not a generalized Dirac comb, its spectrum contains at least (1/(2d2)−o(1))T2 points in every interval of length T, uniformly in the position of the interval as T →∞. The proof combines a spectral gap theorem with a finite difference equation for the spectral masses. For a prescribed set Λ of lower density d<∞on one half-line, we describe the space of measures with support and spectrum in Λ and prove the sharp upper bound ⌊d2⌋for its dimension.
The counting theorems
Poisson summation identifies the Fourier transform of a lattice Dirac comb with a comb on the reciprocal lattice. Translations, modulations and finite linear combinations give a larger family of summation formulas. How can one recognize this family from the locations of the atoms alone? The criterion below uses two counts. On each side of the Fourier transform it suffices to count from the origin in a single direction, and only along a sequence of radii.
We use and . A crystalline measure is a tempered distribution on such that, on compactly supported smooth test functions,
Here and meet every compact interval in finitely many points, and the displayed coefficients are nonzero. Thus and are the actual support and spectrum, with each site counted once after cancellation. The coefficients may be complex. Temperedness is understood in the distributional sense throughout, including when the total variation has no polynomial growth bound.
For a locally finite set put . Its lower densities on the two half-lines are
Write . We say that is relatively separated if . This allows distinct points to be arbitrarily close. We use
for the upper uniform density. An exponential polynomial here is a finite sum with real frequencies. For in reduced form, define its frequency width by
Theorem 1.1 (Density on one half-line). Let be a crystalline measure with support . If , then . For every there is a nonzero exponential polynomial of width less than which vanishes on . In particular, is relatively separated. The counting densities on the positive and negative half-lines both exist and equal . Moreover,
Following Meyer [10], a generalized Dirac comb is a finite linear combination of measures of the form
The summands may have different lattice spacings. For instance, the sum of the combs on and has arbitrarily close atoms. Its Fourier transform has the same property, since the two reciprocal spacings are and .
Theorem 1.2 (Quadratic lower bound for the spectrum). Let be a crystalline measure with support and spectrum . Suppose . If is not a generalized Dirac comb, then
The same statement holds with the support and spectrum interchanged.
Corollary 5.1 gives the corresponding estimate uniformly over all translates of the counting interval and, in particular, on each half-line separately.
Corollary 1.3 (A half-line counting criterion). A crystalline measure is a generalized Dirac comb if and only if and .
Proof. For a generalized Dirac comb both supports are contained in finite unions of lattice translates, by Poisson summation. Conversely, Theorem 1.1 applied to gives . For a nonzero measure, Theorem 1.2 now gives the conclusion. The zero measure is the empty sum.
Relation to earlier results. Lev and Olevskii proved rigidity for measures on the line with uniformly discrete support and spectrum [8]. Their later Theorem 2.2 in [9] already permits bounded unit-interval counts on the spectral side, assuming a positive minimum spacing on the physical side. Baake, Strungaru and Terauds [2 Theorem 6.6] derived a representation on translates of a common lattice when the support lies in a Meyer set and the spectrum has finite upper density along a van Hove sequence. In our one-dimensional setting, Corollary 1.3 allows both sets to have arbitrarily small spacings. Theorem 1.2 also allows the spectrum to have unbounded unit-interval counts.
For the spectral gap argument, Lev and Olevskii [9 Proposition 6.1] obtain a positive lower bound for the centered counting density of a set that supports a nonzero slowly increasing measure with a spectral gap. Their bound depends on the gap length and a uniform bound on the unit-interval counts. In Lemma 2.1 we adapt the oscillation theorem of Eremenko and Novikov [3 Theorem 1] to count locally finite atoms. This gives the gap length itself as a lower bound on each half-line, assuming only distributional temperedness and local finiteness of the atom set.
Meyer [11 Theorem 6] showed that if the support is uniformly discrete, a nonzero compactly supported continuous function annihilates under convolution. The proof following Lemma 15 of [11] constructs such a function for finite unions of uniformly discrete sets by convolving annihilators for the individual sets. Theorem 1.1 gives an annihilator with finitely many point masses in an interval of any length greater than . Meyer’s Lemma 14 studies the support of a solution to a particular finite-difference equation. Proposition 3.1 gives a counting alternative for arbitrary finite shifts with nonzero extreme coefficients.
Olevskii and Ulanovskii characterize supports of unit-mass Fourier quasicrystals as zero sets of exponential polynomials [12]. Alon and Kummer obtain a Lee–Yang description for uniformly discrete crystalline measures with unit weights. For arbitrary weights on uniformly discrete supports they also prove finite generation of the spectral group and polynomial vanishing [1 Theorems 3.1 and 4.2]. Their Lemma 4.7 estimates the dimension of a space of modulations by restricting the Fourier transform to a fixed window. Here a half-line count determines how long that interval must be. By adjoining one frequency to the group generated by the relevant spectral sites, we obtain a polynomial whose width is arbitrarily close to the lower half-line density. Its zero set contains the support and may contain additional points.
Gonçalves and Vedana parameterize summation formulas under weighted growth conditions by almost periodic holomorphic functions [4]. The counting conditions above concern the locations of nonzero atoms and are independent of their sizes. § 6 shows that one finite union of lattice translates contains the supports and spectra of all measures carried on both sides by a prescribed set of finite lower half-line density. The points of that union missing from the prescribed set impose finitely many linear conditions. This gives a reduction of the dimension question raised by Meyer [10 Section 6] and a sharp upper bound in terms of the lower half-line density.
Outline of the argument. A gap in the Fourier transform forces a minimum density of atoms on each half-line. We use this fact to turn a relation visible on one bounded spectral interval into an identity on the whole line. The resulting finite difference equation constrains the spectral masses. Either their locations lie in a finite union of lattice translates, or multiplying the masses by polynomials produces enough independent solutions to force quadratic growth. We prove this alternative in § 3. § 4 recovers the weights on the lattices and § 5 proves Theorem 1.2 and Corollary 5.1.
From a half-line count to an exponential polynomial
A gap in frequency forces many atoms in physical space, even if only one half-line is observed. We use the oscillation theorem of Eremenko and Novikov, who also discuss its extension to tempered distributions [3 Theorem 1 and the subsequent discussion]. The proof below avoids a growth assumption on the total variation of the measure.
Lemma 2.1 (Point counts in the presence of a spectral gap). Let be a tempered distribution that is locally a sum of point masses on a locally finite set . If vanishes on a bounded open interval , then
Proof. Modulate to center the gap at the origin, and write it as . After multiplication by a constant of modulus one, its real part is nonzero. Taking the real part replaces the Fourier transform by its average with its conjugate reflection, so the symmetric gap persists. The atom set of is contained in .
We need a real, continuous function of polynomial growth with for some , whose Fourier transform still has the gap. Here is one construction. Temperedness gives integers and a bound
Apply Hahn–Banach to the map into a finite product of copies of . The Riesz representation theorem then writes , where the real measures satisfy . Each has a locally bounded primitive of polynomial growth, obtained by taking its cumulative mass from the origin. One more integration gives a continuous primitive. Integrating the terms to a common order thus gives a real continuous of polynomial growth with .
On , the distribution is killed by . Its restriction there is consequently a linear combination of . Subtract the inverse transform of this combination from . The subtracted function is a real polynomial of degree less than , by conjugate symmetry. The resulting has the required gap and .
Let denote the greatest number of successive sign changes at ordered points where is nonzero. Eremenko and Novikov use the minimum degree of a nonzero real polynomial for which is nonnegative on . For the continuous, piecewise polynomial function here the counts agree. Each sign transition forces a root of , and one root placed at each transition suffices. Continuity allows the testing points to be chosen in the open interval. The oscillation theorem of Eremenko and Novikov [3 Theorem 1] gives
Indeed, if with , the uniformly continuous weight satisfies and . Their angular-frequency half-width is in our convention.
To bound the sign changes from above, consider an interval slightly larger than . There is the sum of a polynomial of degree at most and the functions for the finitely many atoms in that interval. This follows by taking distributional derivatives. If an absolutely continuous real function alternates sign at ordered points, its successive increments alternate sign. Its derivative takes the respective signs on sets of positive measure in the intervening intervals. Each differentiation therefore costs at most one sign change. The derivatives through order are locally absolutely continuous. After differentiations we take the almost-everywhere step-function representative and choose the sign-testing points away from its jumps. Its jumps in occur only at atoms. Thus
Division by proves the first inequality. Reflection gives the second.
In particular, any interval of length greater than detects whether an exponential multiple vanishes. If vanishes there, then . Indeed, multiplying by an exponential polynomial preserves temperedness and can only remove atoms from . We now construct a nonzero polynomial for which the Fourier transform of vanishes on such an interval.
Proposition 2.2. Suppose is a crystalline measure with support , and . For each there is a nonzero exponential polynomial of frequency width less than which vanishes on .
Proof. Choose with , and let . We seek frequencies in . Only the finitely many points of can be shifted by these frequencies into .
Choose a -basis for the additive group generated by . Choose outside their rational linear span. For and an integer , put
Each frequency has a unique representation. For fixed , the eligible integers lie in an interval of length . Hence
These bounds also hold for the trivial group, with . Choose an integer bounding all coordinates of all points of in absolute value. Take when there are no coordinates. All possible points in lie in . Since , for large the latter set contains fewer points than .
Fix such an , and write , taking off . The equations
have a nonzero solution because there are fewer equations than unknowns. The distinct characters in are linearly independent, so is nonzero. The equations say exactly that the mass of vanishes at every possible point of . Lemma 2.1 now gives . Each atom of has nonzero mass, hence vanishes on . Its frequency width is at most .
Lemma 2.3 (Zero count for an exponential polynomial). For a nonzero exponential polynomial of frequency width , its number of real zeros in any interval of length , counted with multiplicity, is at most .
Proof. This is the elementary real-frequency case of Langer’s zero count [6]. Write , with and all . On , for fixed sufficiently large , the first summand dominates all the others combined. On , the last summand does. Along a horizontal segment of length , oriented from left to right, the changes of argument are therefore at the top and at the bottom. The error is uniform in the endpoints, since the quotient by the dominant term stays in a disk about of radius less than .
On any zero-free vertical edge , rotate the values by a constant phase so that their imaginary part is not identically zero. It is a real linear combination of the functions , so it has at most zeros, by division by the first exponential and induction using Rolle’s theorem. Between consecutive zeros the argument changes by at most . The vertical contributions to the argument principle are thus bounded independently of the edge. Enlarge the real interval by less than one at each end so that the vertical edges avoid zeros. The argument principle on the resulting rectangle bounds the number of enclosed zeros by .
Completion of the proof of Theorem 1.1. If , Proposition 2.2 and Lemma 2.3 give for every . The zero count with also bounds the number of points of in every unit interval. Conversely, each half-line counting ratio has limsup at most , since its interval is among those in the uniform supremum. Both ray ratios therefore converge to . The two preceding results also identify this common value with the infimum of the widths of nonzero exponential polynomials vanishing on . Finally, a nonzero crystalline measure has strictly positive lower density on each ray. Its locally finite spectrum leaves some nonempty open interval free of atoms, to which Lemma 2.1 applies.
A counting alternative for a finite difference equation
The following proposition concerns a function on the real line. Its proof uses only the positions of its nonzero values and a linear relation among its translates. The constant comes from counting monomials in two variables.
Proposition 3.1. Let have locally finite support . Suppose that
If , then either is contained in a finite union of translates of lattices in , or
Proof. Translating the equation, we may take and . We may also assume .
Integer coordinates for the support. If , the equation at shows that for at least one . The equation at shows that for at least one . In either direction, the step is positive, at most , and bounded away from zero. Starting at any in and stepping to the left, we must therefore reach . From we reach the same interval by stepping to the right.
It follows that is contained in the additive subgroup generated by the shifts and the finite set . This group is finitely generated and torsion-free. Fix a basis over and write for the coordinates of . Denote the inverse coordinate map by . The same stepping argument also proves uniqueness from an interval. If a solution of a difference equation of width vanishes on an open interval of length greater than , it vanishes everywhere. A chain of nonzero values starting on either side would have to enter that interval.
Polynomial multiples and observation on an interval. For a polynomial in variables, set for , and set elsewhere. If , then
For constants this is the original equation. For the induction step, subtract from for . The summand corresponding to becomes
The expression in brackets is a polynomial of degree at most in . Thus is a sum of translates of lower-degree polynomial multiples of . The induction hypothesis applies since commutes with translations. Outside every summand is zero.
The extreme shifts of are and , with nonzero coefficients and . Consequently, if is any open interval of length greater than , the values of on determine everywhere. Put , and let be the dimension of the space of restrictions to of polynomials of total degree at most . Multiplication by preserves this dimension, since is nonzero at every point of . Restriction to is injective on these multiples, so
Quadratic growth or a union of lines. Let be the Zariski closure of , the common zero set of all polynomials vanishing on . If an irreducible component of has dimension at least two, two coordinate functions on it are algebraically independent. Indeed, the coordinate functions generate its function field, whose transcendence degree is its dimension. The monomials of degree at most in these two coordinates are therefore linearly independent on . Indeed, a relation on would hold on and hence on this component. We obtain . In (5), take and for all sufficiently large . Division by gives the asserted lower bound.
It remains to treat the case in which every component is a curve or a point. By the forward step above, for every there is a vector
with .
Here is finite and for every . Taking Zariski closures gives . If is an irreducible curve component of , it lies in for some component and some . The component must itself be a curve, and the inclusion is equality, since every proper closed subset of an irreducible algebraic curve is finite.
Starting at we may thus repeatedly pass to a component that is a translate of the preceding one by a vector from . There are finitely many components, so one repeats. The repeated curve is invariant under translation by the sum of the intervening vectors. Since , this sum is nonzero. For any point on the repeated curve, it contains for every positive integer . Every polynomial vanishing on the curve therefore vanishes identically on the complex line . The curve equals that line. Translating back along the chain shows that was a line as well.
Finally, the integer points on any complex affine line are empty, a singleton, or a translate of a cyclic subgroup of . Indeed, if there are two such points, their difference defines a primitive integer direction for the line. Applying sends these integer points into a translated lattice in . The finitely many point components can also be covered by translated lattices. This proves the other alternative.
From lattice supports to lattice combs
Support on several lattices allows their spacings to have irrational ratios. Consequently the different lattices can come arbitrarily close. The following argument works directly with the coefficients at their points.
Proposition 4.1. Let be a crystalline measure on . Suppose that each of and is contained in a finite union of translates of lattices. Then is a finite linear combination of translated and modulated lattice Dirac combs.
Proof. Put , and cover by the sets , with . The function
vanishes on . Write for translation of the coefficient function of a point measure. Fourier transformation of gives
Group the lattices covering according to the rational ratios of their spacings. Write accordingly, assigning an atom at an intersection to one group. For now we use each only through its coefficients. For each , its support is contained in finitely many cosets of for some depending on . The same holds for . Lattices from different groups still intersect in at most one point after arbitrary translations, and only finitely many translations occur in . Since , every nonzero coefficient of occurs at one of these finitely many intersections. Thus has finite support.
Fix . We can remove from every factor with while preserving this conclusion. Indeed, suppose is supported on finitely many cosets of , and has finite support, where and . The translates of these cosets by are disjoint from the original cosets for some positive integer . For each pair of cosets at most one can give an intersection. By telescoping, has finite support. Its two terms have disjoint supports, so has finite support. Applying this observation successively is legitimate because each remaining product of translations preserves containment in finitely many cosets of .
Choose a finer lattice , , so that and all remaining are integer multiples of . Along each of the finitely many relevant cosets of the coefficients of now satisfy, outside a finite set, a constant-coefficient linear recurrence. Write for the coefficient at on a fixed coset and let be the backward shift. With , the remaining factors give
For a solution of the homogeneous recurrence, . Since all roots of have modulus one, so do the exponential bases . The elementary solution formula for linear recurrences shows that the positive tail is a sum of terms , with a polynomial and . An empty product gives the zero tail.
Extend these formulas to all on every coset and sum over the groups. The resulting measure is tempered, by polynomial growth, and agrees with on a right half-line. By Poisson summation, is a finite sum of modulated derivatives of translated lattice combs. Put . Its transform has locally finite support, hence vanishes on some open interval. On the positive ray the support of is finite. Lemma 2.1 gives , so .
Finally, is the reflection of and consists of point masses. Expand the smooth modulation factors multiplying the derivatives of Dirac masses by the product rule. At each site the derivatives of different orders are linearly independent, so all positive-order terms cancel. The order-zero terms are modulated lattice combs, since every derivative of an exponential is a constant multiple of that exponential. Reflection gives the asserted form of .
Proof of the quadratic bound and its consequences
Proof of Theorem 1.2. Write and suppose that the left side of (4) is strictly smaller than . Choose so close to that
By Theorem 1.1, some nonzero exponential polynomial of width vanishes on . A single exponential has no zeros, so . Taking Fourier transforms of gives a finite difference equation of width for the function , extended by zero off . Proposition 3.1 forces to lie in a finite union of lattice translates.
We also need a lattice cover on the physical side. Choose a cover , and take the product of the factors . This nonzero exponential polynomial kills . Its transform gives a difference equation of positive width for the coefficients of on . By Theorem 1.1, is relatively separated, hence . A second application of Proposition 3.1 covers , and thus , by finitely many lattice translates. Proposition 4.1 now identifies as a generalized Dirac comb. Reflection preserves centered counts and interchanges the two half-line densities, so the argument applies in the opposite direction as well.
Corollary 5.1 (Quadratic growth in every interval). Under the hypotheses of Theorem 1.2, if is not a generalized Dirac comb, then
In particular, each spectral half-line satisfies
The conclusions also hold with the support and spectrum interchanged.
Proof. The second paragraph of the proof of Theorem 1.2 shows that a finite lattice cover of would force to be a generalized Dirac comb. Thus has no such cover. For any , choose an annihilator of width as in Theorem 1.1. The resulting recurrence for the spectral coefficients falls in the quadratic case of Proposition 3.1. For any sufficiently large put , so that . The restriction estimate (6) and the monomial count in that proof give, for every ,
The right side is independent of . Dividing by , taking the infimum over and then the lower limit in gives at least , hence at least . Let . Taking and yields the half-line estimates. Reflection gives the assertion in the opposite Fourier orientation.
The quadratic scale is attained. Kurasov and Sarnak [5 Theorems 1 and 2] construct a positive unit-mass crystalline measure whose support is uniformly discrete and which is not a generalized Dirac comb. In their example the spectrum is contained in
for two positive frequencies , , after choosing the Fourier normalization. Counting the integer pairs with gives . Theorem 1.2 gives the matching lower order bound for the actual spectrum. Counting all semigroup points gives an upper bound even if some Fourier coefficients vanish. The example therefore establishes optimality of the exponent. The optimal universal coefficient in (4) remains to be determined.
The case of two subquadratic counts. Suppose that . If any one of the four half-line lower densities is finite, Theorem 1.2, applied in the appropriate direction, forces to be a generalized Dirac comb. Thus a counterexample to rigidity under this joint bound would have to satisfy
Whether such a crystalline measure exists is open.
Measures with prescribed support and spectrum
For a locally finite set , let be the complex vector space of crystalline measures such that and . Meyer [10 Section 6] asked which sets admit a nonzero measure and how the dimension depends on the geometry of the set. For , Corollary 1.3 identifies the measures as generalized Dirac combs. We show that their supports and spectra have a common cover by finitely many lattice translates, with only finitely many points of the cover outside . This reduces the dimension question to the space on that cover and the linear conditions at its missing points. Meyer also asked about the sets for . Their half-line counts grow quadratically, so that question lies outside the hypothesis below.
Let range over finite unions of full lattice translates for which is finite. Include the empty set, with . On define the map
Its rank counts independent conditions. In particular, a single missing point may impose two independent conditions.
Theorem 6.1. If , then every member of is a generalized Dirac comb and . One finite union of lattice translates contains the supports and spectra of all members of , and is finite. For this , the space is the kernel of (7) in . In particular,
where ranges over the unions specified above.
Proof. Both actual supports of every inherit the half-line bound. Corollary 1.3 makes a generalized Dirac comb. For every bounded open interval with , the map
is injective by Lemma 2.1. Thus is finite and every open interval of length contains at least points of . In either or one can fit disjoint open intervals of length . Taking the lower density on each ray gives . Hence for every . Letting proves . The same reasoning gives finite dimension for .
We record why finitely many missing points suffice. The support of any generalized Dirac comb is a finite union of full lattice translates with at most finitely many points removed. To see this, group its terms by commensurable spacings. Within a group, take a positive common multiple of the finitely many spacings and split each lattice into cosets of that common period. On each coset the coefficient sequence has the form , with . By the Skolem–Mahler–Lech theorem [7], its zeros on the integers consist of finitely many full arithmetic progressions and a finite set. For the two-sided formulation, apply the theorem on each half-line. Vanishing on a tail of a progression implies vanishing on the entire progression by the invertible recurrence for its subsequence. Removing the full zero progressions from the coset leaves a finite union of full subprogressions. The remaining zeros remove only finitely many points. Between different groups only finitely many intersection sites can undergo further cancellation. Poisson summation gives the same description for the spectrum.
Take a basis of . For the support and spectrum of each basis vector choose the finite lattice union just obtained. Their union contains all these supports and spectra, and is finite. It follows that is precisely the kernel of in . For every other eligible the corresponding kernel is a subspace of . Rank–nullity proves (8), including attainment. For the zero space take .
Once an attaining is known, the two coefficient conditions at each point of form a finite linear system on . Finding such an from a description of is a separate problem. The proof obtains from the supports and spectra of a basis of .
Example 6.2 (Deleting the origin). The dimension bound is sharp for , where is a positive integer. For , multiplication by fixes , so is periodic with period . Its coefficients on are specified by numbers repeated periodically. Conversely, every such choice belongs to by Poisson summation. Thus .
Now take and . Write for the three repeated coefficients. The physical mass at zero is , and the Fourier mass there is . The two conditions are independent. Thus and . The kernel is spanned by the measure with repeated weights , the character modulo three used by Meyer [10 Lemma 4.2].
A carrier with unbounded unit-interval counts. Take . Its positive half-line has density one, while contains distinct points of for each integer . In particular, and the unit-interval counts are unbounded. The integer comb belongs to by Poisson summation. Theorem 6.1 now gives . Here attains (8) and is empty.
Formalisation. The one-ray formalisation [13] proves that a finite lower half-line count on one carrier gives a nonzero exponential polynomial annihilating the measure. When the counted carrier is the actual support and the opposite count satisfies , it proves the comb conclusion on both sides, in either Fourier orientation. The common-carrier formalisation [14] proves the attained finite-hole formula, including the joint rank of the hole conditions, for bounded unit-interval counts. Theorems 1.1 and 1.2 here give the optimal width and the bound , with the uniform estimate in Corollary 5.1. Theorem 6.1 gives (8) and the sharp bound under the one-ray hypothesis.
References
- [1]L. Alon and M. Kummer, A characterization of uniformly discrete crystalline measures with unit weights, arXiv:2611.24286 (2026).arxiv.org/abs/2611.24286
- [2]M. Baake, N. Strungaru and V. Terauds, Pure point measures with sparse support and sparse Fourier–Bohr support, Trans. Lond. Math. Soc. 7 (2020), 1–32.
- [3]A. Eremenko and D. Novikov, Oscillation of Fourier integrals with a spectral gap, J. Math. Pures Appl. (9) 83 (2004), 313–365.
- [4]F. Gonçalves and G. Vedana, A complete classification of Fourier summation formulas on the real line, arXiv:2504.02741 (2025).arxiv.org/abs/2504.02741
- [5]P. Kurasov and P. Sarnak, Stable polynomials and crystalline measures, J. Math. Phys. 61 (2020), 083501.DOI
- [6]R. E. Langer, On the zeros of exponential sums and integrals, Bull. Amer. Math. Soc. 37 (1931), 213–239.DOI
- [7]C. Lech, A note on recurring series, Ark. Mat. 2 (1953), 417–421.DOI
- [8]N. Lev and A. Olevskii, Quasicrystals and Poisson’s summation formula, Invent. Math. 200 (2015), 585–606.DOI
- [9]N. Lev and A. Olevskii, Fourier quasicrystals and discreteness of the diffraction spectrum, Adv. Math. 315 (2017), 1–26.DOI
- [10]Y. Meyer, Measures with locally finite support and spectrum, Rev. Mat. Iberoam. 33 (2017), 1025–1036.
- [11]Y. Meyer, Crystalline measures and mean-periodic functions, Trans. R. Norw. Soc. Sci. Lett. (2021), no. 2.
- [12]A. Olevskii and A. Ulanovskii, Fourier quasicrystals with unit masses, C. R. Math. Acad. Sci. Paris 358 (2020), 1207–1211.arxiv.org/abs/2009.12810
- [13]Jamie Martin, Annihilation and finite-comb classification from finite lower density on one ray, Palomar Registry, PALOMAR-2026-11-20-000023, version 1 (2026). Registry record.
- [14]Jamie Martin, Finite-comb and finite-hole classification for relatively separated carriers, Palomar Registry, PALOMAR-2026-11-20-000019, version 1 (2026). Registry record.