Preprint
Article

This version is not peer-reviewed.

Hierarchical Exponential Riesz Bases for Four-Interval Partitions

Submitted:

11 October 2026

Posted:

12 October 2026

You are already at the latest version

Abstract
We prove that every four-interval partition of the unit interval admits a partition of the integers such that each frequency union is a Riesz spectrum for the corresponding union of intervals, and also for every interval with the same measure.
Keywords: 
;  ;  ;  

1. Introduction and Main Result

For a discrete set Λ ⊂ R and a finite measure set S ⊂ R , we write E ( Λ ; S ) = { e 2 π i λ ( · ) | S : λ ∈ Λ } for the corresponding system of complex exponentials in L 2 ( S ) . We call Λ its (frequency) spectrum and S its (spatial) domain. We call Λ a Riesz spectrum for S if E ( Λ ; S ) is a Riesz basis for L 2 ( S ) . We are interested in choosing Riesz spectra that respect unions as expressed by the following conjecture of [3].
Conjecture 
(Conjecture 1 ′ in [3]). Let I 1 , … , I L be intervals which form a partition of [ 0 , 1 ) . There exists a partition Z = ⋃ ⋃ · i = 1 L Λ i such that E ( Λ J ; S J ) is a Riesz basis for every nonempty J ⊂ { 1 , … , L } , where
Λ J : = ⋃ i ∈ J Λ i and S J : = ⋃ i ∈ J I i .
Here and throughout, ⋃ ⋃ · denotes a disjoint union, and all unions and partitions of domains are considered up to sets of measure zero.
In this paper, we resolve the case L = 4 of the above conjecture. Note that the case L = 1 is trivial, and the cases L = 2 , 3 are implied by the case L = 4 ; we also provide elementary proofs for L = 2 , 3 below. The case L ≥ 5 appears significantly more challenging, as it requires the Riesz basis property to hold simultaneously for all 2 L − 2 nonempty proper unions.
Theorem 1.
Let 0 = t 0 < t 1 < t 2 < t 3 < t 4 = 1 , and let I i = [ t i − 1 , t i ) and ℓ i = t i − t i − 1 for i = 1 , 2 , 3 , 4 . There exists a partition Z = ⋃ ⋃ · i = 1 4 Λ i such that for every nonempty J ⊂ { 1 , 2 , 3 , 4 } ,
(i)
E ( Λ J ; S J ) is a Riesz basis.
(ii)
E ( Λ J ; I ) is a Riesz basis for every interval I ⊂ R of length d J = ∑ i ∈ J ℓ i ,
(iii)
An increasing sequence Λ J = { λ J , n } n ∈ Z satisfies
sup r ∈ Z , M ∈ N ∑ n = r r + M − 1 λ J , n − n d J − c J ≤ B J
for some constants c J ∈ R and B J > 0 .
Note that no arithmetic assumption is imposed on the endpoints. Setting M = 1 in (1) gives bounded displacement λ J , n = n d J + O ( 1 ) , and dividing by M shows that the centered displacement averages converge uniformly at rate O ( M − 1 ) .

Related Work

Seip [19] proved that every single interval contained in [ 0 , 1 ) admits an integer Riesz spectrum. Kozma and Nitzan [9] extended this result to every finite union of intervals contained in [ 0 , 1 ) . In higher dimensions, Riesz spectra exist for finite unions of axis-parallel rectangles [10] and centrally symmetric convex polytopes whose faces of every dimension are centrally symmetric [7].
Regarding the conjecture, Pfander, Revay, and Walnut [17] proved that for any partition of [ 0 , 1 ) into intervals, there exists a partition of Z whose subunions form Riesz spectra for intervals of the corresponding total lengths. Caragea and Lee [3] showed that for disjoint intervals of [ 0 , 1 ) whose endpoints, together with 1, are linearly independent over Q , there exists a disjoint subsets of Z whose unions are Riesz spectra for the corresponding union of intervals. In [12], the author developed methods for taking unions of exponential Riesz bases.
It is worth noting that there are domains not admitting Riesz spectra. Kozma, Nitzan, and Olevskii [11] constructed a subset of R with no Riesz spectrum. Recently, Ortega-Cerdà [16] and Wan [20] independently proved the nonexistence for Euclidean balls in R d with d ≥ 2 , and nondegenerate triangles in R 2 .

The Cases L = 2 , 3

Although the cases L = 2 , 3 follow from Theorem 1, we provide direct proofs here.
For L = 2 , choose an integer Riesz spectrum Λ 1 for I 1 using the result of Seip [19] (or Proposition 1 below), and set Λ 2 = Z ∖ Λ 1 . Since I 2 = [ 0 , 1 ) ∖ I 1 , Lemma 2 gives a Riesz basis E ( Λ 2 ; I 2 ) . The full union is the Fourier basis on [ 0 , 1 ) , so all nonempty unions are covered.
For L = 3 , the main result of [17] provides a partition Z = Λ 1 ∪ Λ 2 ∪ Λ 3 such that each E ( Λ i ; I i ) is a Riesz basis. Note that every two element union is the complement of the remaining singleton, that is, if { i , j , k } = { 1 , 2 , 3 } , then Λ i ∪ Λ j = Z ∖ Λ k and I i ∪ I j = [ 0 , 1 ) ∖ I k . Therefore, Lemma 2 gives the Riesz basis property for every pair, and the full union is again the Fourier basis on [ 0 , 1 ) . This establishes the case L = 3 of the conjecture.
We identify T = R / Z with [ 0 , 1 ) , and call the image of an interval of length at most one a circular interval. For example, [ 0 , 1 3 ) ∪ [ 2 3 , 1 ) is a circular interval. Note that every nonempty union for L = 2 , 3 is a circular interval. Therefore, the main result of [17], together with integer-frequency circular translation, gives (i) and (ii) in these cases. The estimate (1) in (iii) follows by repeatedly applying Lemma 6 to Z and using the fact that the estimate under every frequency union is preserved by Lemma 4. Corollary 1 then gives the desired Riesz basis property. For L ≥ 4 , a union of intervals and its complement may both be disconnected on T , so this approach is no longer applicable.

Proof strategy

For a partition of [ 0 , 1 ) into four intervals I 1 , I 2 , I 3 , I 4 , the only nonempty unions that are not circular intervals are I 1 ∪ I 3 and I 2 ∪ I 4 . We first construct a Riesz spectrum Λ for I 1 ∪ I 3 satisfying (1). We then split Λ and its complement at the prescribed densities, leaving the alternating frequency unions unchanged. The displacement estimate is preserved by every frequency union. Avdonin’s theorem gives the Riesz basis property for the individual intervals and adjacent pairs, and complementation gives the remaining cases. Our proof relies on the equivalence between bounded centered displacement sums, and a bounded primitive of the centered counting discrepancy, together with a selection of consecutive runs whose errors telescope.

Organization

Section 2 provides the necessary background material. Section 3 combines a counting identity, constructs the required spectra, and proves Theorem 1. Section 4 gives an independent periodic construction for the case of rational endpoints.

2. Preliminaries

For brevity, we write e λ ( x ) = e 2 π i λ x for λ ∈ R . A system E ( Λ ; S ) is called a Riesz basis if it is complete in L 2 ( S ) and there exist constants 0 < A ≤ B < ∞ satisfying
A ∑ λ ∈ Λ | c λ | 2 ≤ ∥ ∑ λ ∈ Λ c λ e λ ∥ L 2 ( S ) 2 ≤ B ∑ λ ∈ Λ | c λ | 2
for every finitely supported sequences { c λ } λ ∈ Λ (see [6,21]). Equivalently, E ( Λ ; S ) is a Riesz basis if and only if the synthesis operator
{ c λ } λ ∈ Λ ⟼ ∑ λ ∈ Λ c λ e λ
is a bounded isomorphism from ℓ 2 ( Z ) onto L 2 ( S ) . For S ⊂ [ 0 , 1 ) and Λ ⊂ Z , the right inequality in (2) holds with B = 1 ; indeed, we have
∥ ∑ λ ∈ Λ c λ e λ ∥ L 2 ( S ) 2 ≤ ∥ ∑ λ ∈ Λ c λ e λ ∥ L 2 [ 0 , 1 ) 2 = ∑ λ ∈ Λ | c λ | 2 .
Lemma 1
(See e.g., [13]). Let Λ ⊂ R be a discrete set and S ⊂ R be a measurable set. If E ( Λ ; S ) is a Riesz basis, then E ( Λ + a ; S + b ) and E ( c − 1 Λ ; c S ) are Riesz bases for every a , b ∈ R and c > 0 .
Since exponentials with integer frequencies are 1-periodic, an integer exponential Riesz bases on a subinterval of T is also a Riesz basis on any circular interval of the same length.
The following complementation principle follows from [15] and [2]; see also [3] and [17]. The finite Fourier matrix counterpart can be found in [14]. For completeness, we provide a short proof here.
Lemma 2.
For a measurable set S ⊂ [ 0 , 1 ) and Λ ⊂ Z , the system E ( Λ ; S ) is a Riesz basis if and only if E ( Z ∖ Λ ; [ 0 , 1 ) ∖ S ) is a Riesz basis.
Proof. 
With respect to the frequency partition Λ , Z ∖ Λ and the spatial partition S , S c ( = [ 0 , 1 ) ∖ S ) , the unitary Fourier synthesis operator can be written in the block matrix form
U = A B C D ,
where the unitarity of U gives A * A + C * C = Id , B * B + D * D = Id , A A * + B B * = Id , and C C * + D D * = Id . Note that invertibility of A (resp. D) is equivalent to E ( Λ ; S ) (resp. E ( Z ∖ Λ ; [ 0 , 1 ) ∖ S ) ) being a Riesz basis. Using the identities ∥ C * C ∥ = ∥ C C * ∥ , ∥ B * B ∥ = ∥ B B * ∥ , we obtain that for 0 < a ≤ 1 ,
A * A = Id − C * C ≥ a Id ⇔ D D * = Id − C C * ≥ a Id ,
and
A A * = Id − B B * ≥ a Id ⇔ D * D = Id − B * B ≥ a Id ,
which implies that A is invertible if and only if D is invertible. This proves the assertion. □
A sequence is separated if the distances between its distinct points have a positive lower bound. Let Λ = { λ n } n ∈ Z be an increasing sequence, and fix d > 0 . We say that Λ has bounded displacement at density d if
λ n = n d + δ n , sup n ∈ Z | δ n | < ∞ .
We say that Λ has bounded centered displacement sums at density d if, denoting δ n = λ n − n d , there are constants c ∈ R and C > 0 such that
∑ n = m m + M − 1 ( δ n − c ) ≤ C for all m ∈ Z , M ∈ N .
A shift of the index origin changes only the centering constant c. Taking M = 1 gives | δ n − c | ≤ C , so the condition (5) already implies bounded displacement and the uniform estimate
sup m ∈ Z 1 M ∑ n = m m + M − 1 ( δ n − c ) ≤ C M .
The estimate (5) is the property that we will preserve throughout the construction.
We will use Avdonin’s theorem [1] in the following form (see also [17]).
Theorem 2.
(Avdonin [1]). Let Λ = { λ n } n ∈ Z ⊂ R be a separated increasing sequence, and assume that λ n = n + δ n with sup n ∈ Z | δ n | < ∞ . If there exist M ∈ N and ε < 1 4 such that
1 M ∑ n = m M ( m + 1 ) M − 1 δ n ≤ ε for all m ∈ Z ,
then E ( Λ ; I ) is a Riesz basis for every interval I of length 1.
Corollary 1.
Assume that Λ is separated and has bounded centered displacement sums at density d > 0 . Then E ( Λ ; I ) is a Riesz basis for every interval I of length d.
Proof. 
Let c and C be the constants in (5). Then the separated sequence Γ = { d ( λ n − c ) } n ∈ Z = { n + d ( δ n − c ) } n ∈ Z has bounded displacements, and each displacement average over M consecutive terms has absolute value at most d C M . Choosing an integer M > 4 d C and applying Theorem 2, we have that E ( Γ ; I ) is a Riesz basis for every interval I of length 1. Since Γ is obtained from Λ by a translation and a scaling, Lemma 1 yields the desired Riesz bases property. □

3. Proof of the Main Result

For an increasing sequence Λ = { λ n } n ∈ Z satisfying (4), we define
N Λ ( x ) = n if λ n ≤ x < λ n + 1 , D Λ ( x ) = N Λ ( x ) − d x .
It is easy to see that N Λ ( y ) − N Λ ( x ) = # ( Λ ∩ ( x , y ] ) for x < y , and
# ( Λ ∩ [ x , x + R ) ) = d R + O ( 1 )
uniformly in x ∈ R and R > 0 , where # denotes the cardinality of a set. The bounded displacement condition (4) is equivalent to boundedness of D Λ ; in particular, setting δ n = 0 for all n ∈ Z gives − 1 ≤ D Λ ( x ) ≤ 0 for all x ∈ R .
Lemma 3.
Under (4), condition (5) holds with centering constant c if and only if the centered counting discrepancy has a bounded primitive
sup x < y ∫ x y ( D Λ ( t ) − μ ) d t < ∞ , μ = − 1 2 − c d .
Proof. 
Let e n = δ n − c for n ∈ Z . On [ λ n , λ n + 1 ) , the function D Λ − μ is affine with
D Λ ( λ n ) − μ = 1 2 − d e n , lim t → λ n + 1 − D Λ ( t ) − μ = − 1 2 − d e n + 1 .
Since λ n + 1 − λ n = 1 d + e n + 1 − e n , we have
∫ λ n λ n + 1 ( D Λ ( t ) − μ ) d t = − e n + e n + 1 2 − d 2 ( e n + 1 2 − e n 2 ) .
Summing over n = m , … , p − 1 gives
∫ λ m λ p ( D Λ ( t ) − μ ) d t = − ∑ n = m + 1 p e n + e p − e m 2 − d 2 ( e p 2 − e m 2 ) .
Since { e n } n ∈ Z is bounded, the last two terms are uniformly bounded. This proves the equivalence for endpoints in Λ . Bounded displacement also bounds the gaps and D Λ , so moving arbitrary endpoints to neighboring points of Λ changes the integral by a uniformly bounded amount. □
Lemma 4. (i)The property of having bounded centered displacement sums is preserved by positive dilations, translations, and finite disjoint unions, provided that the union is separated. The density of a disjoint union is the sum of the densities.
(ii)Assume that Λ ⊂ Γ are separated sets, and both sets have bounded centered displacement sums at densities a , d , respectively, where 0 < a < d . Then Γ ∖ Λ has the same property at density d − a . In particular, if Λ ⊂ Z has this property at density 0 < a < 1 , then Z ∖ Λ has the same property at density 1 − a .
Proof. (i) Assume that λ n = n / d + δ n satisfies (5) with centering constant c. For q > 0 and r 0 ∈ R , the sequence { q λ n + r 0 } n ∈ Z has density d / q and displacements q δ n + r 0 . Centering at q c + r 0 multiplies every sum in (5) by q, so the assertion holds for positive dilations and translations.
Next, let U = ⋃ ⋃ · j = 1 k Λ j be separated, where each Λ j has bounded centered displacement sums at density d j > 0 . By Lemma 3, there exists a constant μ j such that D Λ j − μ j has a bounded primitive. Adding the counting estimates gives
# ( U ∩ [ x , x + R ) ) = d U R + O ( 1 ) , d U = ∑ j = 1 k d j ,
uniformly in x ∈ R and R > 0 , so U has a bilateral increasing enumeration at density d U . Since counting increments add, its discrepancy satisfies
D U = ∑ j = 1 k D Λ j + C 0 ,
where C 0 accounts for the choices of index origins. This shows that D U is bounded. Since μ U = ∑ j = 1 k μ j + C 0 , it follows that D U − μ U = ∑ j = 1 k ( D Λ j − μ j ) has a bounded primitive. Then Lemma 3 implies that the assertion holds for disjoint unions.
(ii) Let V = Γ ∖ Λ . Subtracting the counting estimates gives
# ( V ∩ [ x , x + R ) ) = ( d − a ) R + O ( 1 )
uniformly in x ∈ R and R > 0 , so the separated set V has a bilateral increasing enumeration at density d − a . Its counting discrepancy satisfies
D V = D Γ − D Λ + C 1 ,
where C 1 accounts for the choices of index origins. Choose μ Γ and μ Λ as in Lemma 3. Then D V is bounded, and D V − ( μ Γ − μ Λ + C 1 ) has a bounded primitive. By Lemma 3, we conclude that V has bounded centered displacement sums at density d − a . Finally, choosing λ n = n gives bounded centered displacement sums for Z at density 1, so the special case follows by taking Γ = Z . □
We will first construct integer spectra for circular intervals with the displacement estimate needed below.
Proposition 1.
For every 0 < s ≤ 1 , there exists a set Δ s ⊂ Z with bounded centered displacement sums at density s such that E ( Δ s ; I ) is a Riesz basis for every circular interval I of length s.
Proof. 
For 0 < s ≤ 1 2 , let Δ s = { λ n } n ∈ Z be given by
λ n = Q n − Q n − 1 with Q n = n ( n + 1 ) 2 s .
Setting ε n : = Q n − n ( n + 1 ) 2 s ∈ ( − 1 , 0 ] , we may write
λ n − n s = ε n − ε n − 1 .
Then for any n ∈ Z , we have
λ n + 1 − λ n = 1 s + ε n + 1 − 2 ε n + ε n − 1 > 1 s − 2 ≥ 0 ,
which shows that { λ n } n ∈ Z ⊂ Z is a strictly increasing separated sequence. Moreover, every displacement sum telescopes, that is, for any m ∈ Z and M ∈ N ,
∑ n = m m + M − 1 λ n − n s = ∑ n = m m + M − 1 ε n − ε n − 1 = | ε m + M − 1 − ε m − 1 | < 1 .
Therefore, Δ s has bounded centered displacement sums at density s with center zero.
For 1 2 < s < 1 , let Δ s = Z ∖ Δ 1 − s . Then Δ s ⊂ Z is separated and has bounded centered displacement sums at density s by Lemma 4.
For s = 1 , let Δ 1 = Z .
In every case, Corollary 1 gives the Riesz basis property on intervals of length s, and integer frequencies allow circular translation (see the discussion after Lemma 1). Therefore, E ( Δ s ; I ) is a Riesz basis for every circular interval I of length s. □
Let N ∈ N and let S ⊂ [ 0 , 1 ) be a measurable set. For j = 1 , … , N , define
A ≥ j : = t ∈ [ 0 , 1 N ) : t + k N ∈ S for at least j values of k ∈ { 0 , 1 , … , N − 1 } = t ∈ [ 0 , 1 N ) : ∑ k = 0 N − 1 1 1 S ( t + k N ) ≥ j .
We use the folding lemma of Kozma and Nitzan [9], which asserts that if Ξ j ⊂ N Z is a Riesz spectrum for A ≥ j for every j, then
⋃ j = 1 N ( Ξ j + j )
is a Riesz spectrum for S. Here, empty levels are assigned the empty spectrum. The labels 1 , … , N are the consecutive residue labels of this lemma; the integer N need not be prime.
For a union of two intervals, we choose an integer N such that every normalized folded level N A ≥ j is empty, the full interval T = [ 0 , 1 ) , or one circular interval. The existence of infinitely many such integers follows from the two-interval case of the component reduction lemma [10], which is based on [9]. Here, we provide a direct proof with an explicit condition on N. For X ⊂ R , we write X mod 1 : = { x mod 1 : x ∈ X } ⊂ T .
Lemma 5.
Let 0 ≤ a 1 < b 1 < a 2 < b 2 < 1 . Write h 1 = b 1 − a 1 and h 3 = b 2 − a 2 for the lengths of the intervals [ a 1 , b 1 ) and [ a 2 , b 2 ) , and h 2 = a 2 − b 1 and h 4 = 1 − b 2 + a 1 for the lengths of the two circular gaps between them. Then h i > 0 and h 1 + h 2 + h 3 + h 4 = 1 . For N ∈ N , let σ i = σ i ( N ) : = N h i − N h i ∈ [ 0 , 1 ) ,
w ( N ) = σ 1 + σ 2 + σ 3 + σ 4 = N − ∑ i = 1 4 N h i ∈ { 0 , 1 , 2 , 3 } ,
and
J 1 = ( N a 1 + [ 0 , σ 1 ) ) mod 1 = { ( N a 1 + t ) mod 1 : 0 ≤ t < σ 1 } ⊂ T ,
J 2 = ( N a 2 + [ 0 , σ 3 ) ) mod 1 = { ( N a 2 + t ) mod 1 : 0 ≤ t < σ 3 } ⊂ T .
(a) If w ( N ) = 2 , then J 1 ∪ J 2 and J 1 ∩ J 2 are circular intervals, possibly empty or full.
(b) There exist infinitely many N ∈ N with w ( N ) = 2 .
Proof. 
Since ∑ i N h i = N , the number w ( N ) is an integer satisfying 0 ≤ w ( N ) < 4 . Let τ 0 = 0 and τ i = σ 1 + … + σ i for 1 ≤ i ≤ 4 , so that τ 4 = w ( N ) . Note that N a 2 − N a 1 = N h 1 + N h 2 differs from τ 2 by an integer. Therefore, after a rotation of T (which does not affect the assertions), we may assume that J 1 = [ τ 0 , τ 1 ) mod 1 and J 2 = [ τ 2 , τ 3 ) mod 1 . Let G 1 = [ τ 1 , τ 2 ) mod 1 and G 2 = [ τ 3 , τ 4 ) mod 1 . Since each interval [ τ i − 1 , τ i ) has length σ i < 1 , it is mapped injectively into T . These intervals form a partition of [ 0 , w ( N ) ) , which contains exactly w ( N ) points of each coset of Z . Consequently, we have that
every point of T lies in exactly w ( N ) of the four arcs J 1 , G 1 , J 2 , G 2 .
(a) Assume that w ( N ) = 2 . If x ∈ [ τ 0 , τ 1 ) and x + k ∈ [ τ 2 , τ 3 ) for some k ∈ Z , then k ≥ 1 , since x < τ 1 ≤ τ 2 ≤ x + k . Also, we have k ≤ 1 , since x + k < τ 3 ≤ τ 4 = 2 ≤ x + 2 . Therefore, we have
J 1 ∩ J 2 = [ τ 0 , τ 1 ) ∩ [ τ 2 − 1 , τ 3 − 1 ) mod 1 ,
which is empty or the image of an interval of length less than 1. Similaryl, if x ∈ [ τ 1 , τ 2 ) and x + k ∈ [ τ 3 , τ 4 ) for some k ∈ Z , then k = 1 , since x < τ 2 ≤ τ 3 ≤ x + k and x + k < τ 4 = 2 ≤ τ 1 + 2 ≤ x + 2 . Therefore, G 1 ∩ G 2 is empty or equal to [ ξ , ξ ′ ) mod 1 for some ξ < ξ ′ < ξ + 1 . It follows from (6) that a point of T lies outside J 1 ∪ J 2 if and only if it lies in G 1 ∩ G 2 . Therefore, J 1 ∪ J 2 = T ∖ ( G 1 ∩ G 2 ) is either T = [ 0 , 1 ) or [ ξ ′ , ξ + 1 ) mod 1 , which proves (a).
(b) Since σ i ( N + 1 ) − σ i ( N ) ∈ { h i , h i − 1 } , we have
w ( N + 1 ) − w ( N ) ≤ h 1 + h 2 + h 3 + h 4 = 1 for N ∈ N .
Let ζ : = min i ( min { h i , 1 − h i } ) . Since min i h i ≤ 1 4 , we musts have 0 < ζ ≤ 1 4 . Fix any m ∈ N . By Dirichlet’s theorem on simultaneous approximation (see e.g., [18]), applied to m h 1 , m h 2 , m h 3 , m h 4 , there exist integers q ≥ 1 and z 1 , z 2 , z 3 , z 4 ∈ Z such that Q = q m satisfies
γ i : = Q h i − z i ∈ ( − ζ , ζ ) for i = 1 , 2 , 3 , 4 .
Since Q ≥ m and m is arbitrary, there are arbitrarily large integers Q with this property. For each such Q, the sum γ 1 + γ 2 + γ 3 + γ 4 = Q − ∑ i z i is an integer of absolute value less than 4 ζ ≤ 1 , and hence equals zero. Moreover, h i + γ i ∈ ( 0 , 1 ) and 1 − h i + γ i ∈ ( 0 , 1 ) , so that for Q ≥ 2 , we have
σ i ( Q + 1 ) = h i + γ i , σ i ( Q − 1 ) = 1 − h i + γ i .
Summing over i gives w ( Q + 1 ) = 1 and w ( Q − 1 ) = 3 . Choose two such integers 2 ≤ Q < Q ′ with Q ′ ≥ Q + 3 . Since w ( Q ′ − 1 ) = 3 and Q ′ − 1 ≥ Q + 2 , there is a least integer N > Q + 1 with w ( N ) ≥ 2 , and this integer satisfies N ≤ Q ′ − 1 . If N − 1 = Q + 1 , then w ( N − 1 ) = 1 ; otherwise, the minimality of N gives w ( N − 1 ) < 2 . In either case, we have w ( N − 1 ) ≤ 1 , and (7) gives w ( N ) = 2 . Since Q can be arbitrarily large, there exist infinitely many such N. □
Remark 1.
The condition w ( N ) = 2 is sufficient but not necessary. In fact, the conclusion of Lemma 5 (a) holds if and only if w ( N ) = 2 or σ i ( N ) = 0 for some i. To see this, assume that w ( N ) ≠ 2 and use the notation from the proof. First, assume that σ i ( N ) = 0 for some i. Then w ( N ) < 3 , since the sum of three numbers in [ 0 , 1 ) is less than 3. Since w ( N ) ≠ 2 , it follows that w ( N ) ≤ 1 . If w ( N ) = 0 , then all four arcs are empty. If w ( N ) = 1 , then the four arcs are pairwise disjoint by (6), and hence J 1 ∩ J 2 = ⌀ . In this case, J 1 ∪ J 2 equals J 2 , J 1 , [ τ 0 , τ 3 ) mod 1 or [ τ 2 , τ 1 + 1 ) mod 1 if σ 1 , σ 3 , σ 2 or σ 4 vanishes, respectively. Here, τ 1 = τ 2 if σ 2 = 0 , and τ 3 = τ 4 = τ 0 + 1 if σ 4 = 0 . The last two sets are images of intervals of lengths 1 − σ 4 and 1 − σ 2 , respectively.
Now, assume that σ i ( N ) > 0 for all i. Then w ( N ) ∈ { 1 , 3 } . If w ( N ) = 1 , then 0 < τ 1 < τ 2 < τ 3 < 1 , and J 1 ∪ J 2 = [ 0 , τ 1 ) ∪ [ τ 2 , τ 3 ) has two components. If w ( N ) = 3 , then 0 < τ 3 − 2 < τ 2 − 1 < τ 1 < 1 , and J 1 ∩ J 2 = [ 0 , τ 3 − 2 ) ∪ [ τ 2 − 1 , τ 1 ) has two components. For example, the conclusion of Lemma 5 (a) always fails for N = 1 , since w ( 1 ) = 1 and σ i ( 1 ) = h i > 0 .
Proposition 2.
Let S = [ a 1 , b 1 ) ∪ [ a 2 , b 2 ) , 0 ≤ a 1 < b 1 < a 2 < b 2 < 1 , and d = | S | . There exists Γ ⊂ Z such that E ( Γ ; S ) is a Riesz basis and Γ has bounded centered displacement sums at density d.
Proof. 
By Lemma 5 (b), we can choose N with w ( N ) = 2 . Let
ℓ i = b i − a i , q i = N ℓ i , r i = N ℓ i − q i , q = q 1 + q 2 ,
and define the residual arcs
J i = ( N a i + [ 0 , r i ) ) mod 1 = { ( N a i + t ) mod 1 : 0 ≤ t < r i } ⊂ T for i = 1 , 2 .
An arc with r i = 0 is empty. Since ℓ 1 = h 1 and ℓ 2 = h 3 , we have r 1 = σ 1 and r 2 = σ 3 ; hence, these are the arcs J 1 , J 2 of Lemma 5. Exactly q i + 1 1 J i ( N u ) of the points u + k N , 0 ≤ k < N , lie in [ a i , b i ) . Hence, the folded multiplicity is q + 1 1 J 1 ( N u ) + 1 1 J 2 ( N u ) , and
N A ≥ j = T , j ≤ q , J 1 ∪ J 2 , j = q + 1 , J 1 ∩ J 2 , j = q + 2 , ⌀ , j > q + 2 .
Since w ( N ) = 2 , we have N = q + N h 2 + N h 4 + 2 ≥ q + 2 , and Lemma 5 (a) shows that both intermediate levels are circular intervals, possibly empty or full. Let α = | J 1 ∪ J 2 | and β = | J 1 ∩ J 2 | , and use the spectra Δ s from Proposition 1, with Δ 0 = ⌀ . For j ≤ q , the level A ≥ j = [ 0 , 1 N ) has spectrum N Z . Scaling gives the spectra N Δ α and N Δ β for A ≥ q + 1 and A ≥ q + 2 , respectively. The folding lemma therefore shows that
Γ = ⋃ j = 1 q ( N Z + j ) ∪ ( N Δ α + q + 1 ) ∪ ( N Δ β + q + 2 )
is a Riesz spectrum for S. After omitting empty terms, this is a finite union of separated sets in distinct residue classes modulo N. Lemma 4 gives bounded centered displacement sums, and its density is given by
q + α + β N = q + r 1 + r 2 N = ℓ 1 + ℓ 2 = d .
□
Remark 2.
The spectra constructed in [9] have bounded counting discrepancy, and thus have bounded displacement (see [9]). Here, we also require bounded centered displacement sums. Proposition 1 provides this stronger estimate for the interval spectra, and Lemma 4 preserves it through folding.
The following is a key lemma which allows us to select one consecutive run from each block of a prescribed frequency set. The runs are chosen so that their displacement sums telescope. It should be noted that no Riesz basis property of the prescribed set is assumed.
Lemma 6
(Balanced splitting). Let Γ = { γ n } n ∈ Z be increasingly enumerated and separated, with bounded displacement at density d > 0 , and let 0 < a < d . Then there exists a subset Γ a ⊂ Γ with bounded centered displacement sums at density a and centering constant zero. Moreover, if Γ has bounded centered displacement sums at density d, then Γ ∖ Γ a has bounded centered displacement sums at density d − a .
Proof. Step 1. Identify some candidate runs
Let θ = a d and D = sup n | γ n − n d | < ∞ . For a sufficiently large integer K, we divide the indices of Γ into blocks [ m K , ( m + 1 ) K ) ∩ Z , and then set A m = θ m K and k m = A m + 1 − A m . Then A m = θ m K + O ( 1 ) and k m = θ K + O ( 1 ) uniformly in m, and 1 ≤ k m ≤ K − 1 for large K. We will select k m consecutive points from block m, assigning them the indices A m , … , A m + 1 − 1 . Their target sum is
T m = ∑ j = A m A m + 1 − 1 j a .
The possible consecutive runs have sums
W m , r = ∑ i = 0 k m − 1 γ m K + r + i for 0 ≤ r ≤ K − k m .
These sums increase, and their successive increments satisfy
0 < W m , r + 1 − W m , r = γ m K + r + k m − γ m K + r ≤ k m d + 2 D ≤ H K ,
where H K : = K d + 2 D . Let
L m = W m , 0 , U m = W m , K − k m , ε n = γ n − n d , η m = A m − θ m K ∈ ( − 1 , 0 ] .
For k = k m , direct subtraction gives
T m − L m = k η m a + d − a 2 a d k ( k − 1 ) − ∑ i = 0 k − 1 ε m K + i , U m − L m = k ( K − k ) d + ∑ i = 0 k − 1 ( ε m K + K − k + i − ε m K + i ) .
Since k = θ K + O ( 1 ) , | η m | ≤ 1 , and | ε n | ≤ D , we have
T m − L m = κ K 2 + O ( K ) , U m − T m = κ K 2 + O ( K ) ,
where κ = θ ( 1 − θ ) 2 d > 0 . The error constants depend only on a , d , D , so these estimates are uniform in m. Since H K = O ( K ) , fix K large enough so that both margins exceed H K for every m.
Step 2. Balance the sums
Choose one window sum s m = W m , r m per block and numbers E m with | E m | ≤ H K 2 and
s m − T m = E m + 1 − E m .
Set E 0 = 0 . For m ≥ 0 , let s m be a window sum closest to T m − E m and let E m + 1 = E m + s m − T m . For m < 0 , proceed backward: let s m be a window sum closest to T m + E m + 1 and let E m = T m + E m + 1 − s m . In both cases the target lies in [ L m , U m ] , since the margins exceed H K , and the window sums increase from L m to U m in steps of at most H K by (8). Hence, the closest window sum is within H K 2 of the target, and the new error again has absolute value at most H K 2 .
Step 3. The displacement estimate
Let Γ a consist of the selected runs given by
λ A m + i = γ m K + r m + i for 0 ≤ i < k m , m ∈ Z .
Since k m ≥ 1 and A m → ± ∞ as m → ± ∞ , the index intervals [ A m , A m + 1 ) ∩ Z partition Z . The selected sequence is increasing because the original blocks are ordered. If λ j = γ n is chosen from block m, then
0 ≤ n d − m K d < K d , − 1 a < j a − m K d < K d .
Hence, we have
D K : = sup j | λ j − j a | ≤ D + K d + 1 a < ∞ .
Define a discrete primitive by
P 0 = 0 , P j + 1 − P j = λ j − j a for j ∈ Z .
Since A 0 = 0 , equation (9) gives P A m = E m for every m ∈ Z . For A m ≤ j < A m + 1 , we therefore have
| P j | ≤ | E m | + k m D K ≤ H K 2 + K D K .
Consequently, we have
∑ j = u u + M − 1 λ j − j a = | P u + M − P u | ≤ H K + 2 K D K for u ∈ Z , M ∈ N .
Therefore, Γ a has bounded centered displacement sums with center zero, and it inherits separation from Γ . Moreover, if Γ has bounded centered displacement sums, then Lemma 4 gives the same property at density d − a for Γ ∖ Γ a . □
We are now ready to prove the main result, Theorem 1.
Proof 
(Proof of Theorem 1). Let S = I 1 ∪ I 3 = [ 0 , t 1 ) ∪ [ t 2 , t 3 ) and d = ℓ 1 + ℓ 3 . Then Proposition 2 provides a Riesz spectrum Γ ⊂ Z for S with bounded centered displacement sums at density d. By Lemma 4, the complement Γ ′ = Z ∖ Γ has the same displacement property at density 1 − d . Applying Lemma 6 to Γ with a = ℓ 1 and to Γ ′ with a = ℓ 2 , we obtain Γ = Λ 1 ∪ Λ 3 and Γ ′ = Λ 2 ∪ Λ 4 , where each Λ i has bounded centered displacement sums at density ℓ i . For every nonempty J ⊂ { 1 , 2 , 3 , 4 } , Lemma 4 gives this property for the separated union Λ J = ⋃ i ∈ J Λ i ⊂ Z at density d J = ∑ i ∈ J ℓ i , so that (1) is satisfied. Moreover, Corollary 1 gives the Riesz basis property on every interval of length d J . This proves (ii) and (iii).
It now remains to prove (i). The sets I 1 , I 2 , I 3 , I 4 , I 1 ∪ I 2 , and I 2 ∪ I 3 are single intervals, so their Riesz basis property follows from (ii). The set I 1 ∪ I 3 has the Riesz spectrum Γ = Λ 1 ∪ Λ 3 by construction. These seven sets and their complements exhaust the 2 4 − 2 = 14 proper nonempty subsets of { 1 , 2 , 3 , 4 } . Therefore, Lemma 2 gives all the remaining proper unions. The full union is the usual Fourier orthonormal basis on [ 0 , 1 ) . This establishes (i). □

4. A Periodic Construction for Rational Endpoints

In the case of rational endpoints, we can explicitly construct periodic Riesz spectra using finite Fourier matrices. We need the following lemma, which is a special case of [12]. For completeness, we provide a short proof here.
Lemma 7
(See e.g., [12]). For any A , B ⊂ { 0 , … , N − 1 } with same cardinality, the system
E N Z + A ; ⋃ b ∈ B [ b N , b + 1 N )
is a Riesz basis if and only if
F N [ A , B ] = e − 2 π i a b / N a ∈ A , b ∈ B
is invertible. Here, the set N Z + A is understood as ⋃ a ∈ A ( N Z + a ) , and F N [ A , B ] is the submatrix of the order N Fourier matrix F N = e 2 π i k ℓ / N k , ℓ = 0 N − 1 with rows and columns indexed by A and B, respectively.
Proof. 
For finitely supported coefficients { c n , a } n ∈ Z , a ∈ A , let
f ( x ) = ∑ a ∈ A ∑ n ∈ Z c n , a e 2 π i ( N n + a ) x .
For 0 ≤ t < 1 N , we have
f ( t + b N ) b ∈ B = ( F N [ A , B ] ) * diag ( { e 2 π i a t } a ∈ A ) g a ( t ) a ∈ A ,
where
g a ( t ) = ∑ n ∈ Z c n , a e 2 π i N n t for a ∈ A .
The matrix diag ( { e 2 π i a t } a ∈ A ) is always invertible, and the map
{ c n , a } n ∈ Z , a ∈ A ⟼ { g a ( t ) } a ∈ A , 0 ≤ t < 1 N
is unitary up to a constant, since E ( N Z , [ 0 , 1 N ) ) is an orthogonal basis. Therefore, the matrix F N [ A , B ] is invertible if and only if the map
{ c n , a } n ∈ Z , a ∈ A ⟼ { f ( t + b N } b ∈ B , 0 ≤ t < 1 N
is invertible, equivalently, the synthesis operator (see (3))
{ c n , a } n ∈ Z , a ∈ A ⟼ f ( x ) = ∑ a ∈ A ∑ n ∈ Z c n , a e 2 π i ( N n + a ) x , x ∈ ⋃ b ∈ B [ b N , b + 1 N )
is invertible, i.e., E ( N Z + A ; ⋃ b ∈ B [ b N , b + 1 N ) ) is a Riesz basis. □
Proposition 3.
Let 0 = t 0 < t 1 < t 2 < t 3 < t 4 = 1 , and let I i = [ t i − 1 , t i ) and ℓ i = t i − t i − 1 for i = 1 , 2 , 3 , 4 . Assume that t i = k i / N for some integers 0 = k 0 < k 1 < k 2 < k 3 < k 4 = N , and let n i = k i − k i − 1 for i = 1 , 2 , 3 , 4 . Consider the partition of Z N = { 0 , … , N − 1 } into consecutive blocks in the order 1 , 3 , 2 , 4 :
A 1 = { 0 , … , n 1 − 1 } , A 3 = { n 1 , … , n 1 + n 3 − 1 } , A 2 = { n 1 + n 3 , … , n 1 + n 3 + n 2 − 1 } , A 4 = { n 1 + n 3 + n 2 , … , N − 1 } .
Then Λ i = N Z + A i ( = ⋃ a ∈ A i N Z + a ) , i = 1 , 2 , 3 , 4 , satisfy the conclusion of Theorem 1.
Proof. 
Note that # A i = n i by construction. For i = 1 , 2 , 3 , 4 , let B i = { k i − 1 , … , k i − 1 } , so that # B i = k i − k i − 1 = n i . We will apply Lemma 7 with A J : = ⋃ i ∈ J A i and B J : = ⋃ i ∈ J B i for nonempty J ⊂ { 1 , 2 , 3 , 4 } . For this, we observe that the order N Fourier matrix F N = e 2 π i k ℓ / N k , ℓ = 0 N − 1 is a Vandermonde matrix. For any A , B ⊂ { 0 , … , N − 1 } with same cardinality, the Fourier submatrix F N [ A , B ] is a Vandermonde matrix (up to factoring out the initial powers) if A or B is cyclically consecutive modulo N.
Note that for every nonempty J ⊂ { 1 , 2 , 3 , 4 } except { 1 , 3 } and { 2 , 4 } , the set B J is cyclically consecutive. For J = { 1 , 3 } and J = { 2 , 4 } , the set A J is consecutive by construction; indeed, the sets A { 1 , 3 } = A 1 ∪ A 3 and A { 2 , 4 } = A 2 ∪ A 4 are consecutive. Therefore, the matrix F N [ A J , B J ] is invertible for every nonempty J ⊂ { 1 , 2 , 3 , 4 } , equivalently, with Λ J : = ⋃ i ∈ J Λ i = ⋃ i ∈ J ( N Z + A i ) = N Z + A J and S J : = ⋃ i ∈ J I i = ⋃ i ∈ J [ t i − 1 , t i ) = ⋃ b ∈ B J [ b N , b + 1 N ) , the system E ( Λ J ; S J ) is a Riesz basis for every nonempty J ⊂ { 1 , 2 , 3 , 4 } . This proves (i) of Theorem 1 for the case of rational endpoints.
For (ii), fix any nonempty J ⊂ { 1 , 2 , 3 , 4 } , and let r : = # A J ( = ∑ i ∈ J n i ) , so that d J = ∑ i ∈ J ℓ i = ∑ i ∈ J n i N = r N . Choosing the consecutive index set B = { 0 , … , r − 1 } , Lemma 7 gives that E ⋃ i ∈ J ( N Z + A i ) ; [ 0 , r N ) is a Riesz basis. Moreover, Lemma 1) allows for translation of [ 0 , r N ) while preserving the Riesz basis property. Therefore, E ⋃ i ∈ J ( N Z + A i ) ; I is a Riesz basis for every interval I ⊂ R of length d J . THis proves (ii) of Theorem 1 for the case of rational endpoints.
Finally, note that the increasingly enumerated set Λ J = N Z + A J is N-periodic and satisfies λ n + r = λ n + N for all n ∈ Z . Since d J = r N , its displacements δ n = λ n − n d J are r-periodic. Subtracting their period mean c J makes every complete period sum to zero. Then any remaining partial period has uniformly bounded sum, which gives (1). This proves (iii) of Theorem 1 for the case of rational endpoints. □
Example 1.
Consider the case of four equal intervals, i.e., I i = [ i − 1 4 , i 4 ) for i = 1 , 2 , 3 , 4 . Proposition 3 gives Λ 1 = 4 Z , Λ 2 = 4 Z + 2 , Λ 3 = 4 Z + 1 , Λ 4 = 4 Z + 3 . Note that the two alternating frequency unions are
Λ 1 ∪ Λ 3 = 4 Z ∪ ( 4 Z + 1 ) , Λ 2 ∪ Λ 4 = ( 4 Z + 2 ) ∪ ( 4 Z + 3 ) .
In each case, the two frequency residues are consecutive modulo 4, so the corresponding Fourier submatrix is invertible. Therefore, Lemma 7 gives the Riesz basis property for E ( Λ J ; S J ) when J = { 1 , 3 } or J = { 2 , 4 } . Every other nonempty J ⊂ { 1 , 2 , 3 , 4 } is cyclically consecutive modulo 4 (equivalently, S J = ⋃ i ∈ J I i is a circular interval on T = [ 0 , 1 ) ), so the same argument applies.
In view of Lemma 7 and Example 1, a sufficient condition for the rational-endpoint case of the conjecture is that for every N ∈ N , there exists a permutation matrix P ∈ { 0 , 1 } N × N such that all principal minors of P F N are nonzero (see [5]). The case of the identity permutation P = I was studied in [4,5]. Recently, numerical experiments gave a negative answer for N = 16 , i.e., no such permutation matrix exists for N = 16 . Nevertheless, the failure of this sufficient condition does not rule out other constructions, so the rational-endpoint case for L ≥ 5 remains open.
For partitions into five or more intervals, the unions that are disconnected on T form several distinct complementary pairs. Therefore, preserving the Riesz basis property for a single union and its complement is no longer sufficient to establish the full hierarchy, unlike the case L = 4 . Extending the construction would require simultaneous control of the Riesz basis property for these additional pairs, making it substantially more difficult.

Acknowledgments

D. G. Lee is supported by the National Research Foundation of Korea (NRF) grant funded by the Korean government (MSIT) (RS-2026-25598099).

References

  1. Avdonin, S. A. On the question of Riesz bases of exponential functions in L2, Vestnik Leningrad. Univ. (1974), no. 13. Mat. Mekh. Astron. 154 (Russian); English translation in Vestnik Leningrad Univ. Math. 7 (1979). vyp. 3, 5–12 203–211.
  2. Bownik, M.; Casazza, P.; Marcus, A. W.; Speegle, D. Improved bounds in Weaver and Feichtinger conjectures. J. Reine Angew. Math. 2019, 749, 267–293. [Google Scholar] [CrossRef]
  3. Caragea, A.; Lee, D. G. A note on exponential Riesz bases, Sampl. Theory Signal Process. Data Anal. 2022, 20, 13. [Google Scholar] [CrossRef]
  4. Caragea, A.; Lee, D. G. On the principal minors of Fourier matrices, To appear in Commun. Korean Math. Soc. arXiv:2409.09793.
  5. Caragea, A.; Lee, D. G.; Malikiosis, R. D.; Pfander, G. E. Principal minors of Fourier matrices of square-free order, To appear in Discrete Anal. arXiv arXiv:2505.24326.
  6. O. Christensen, An Introduction to Frames and Riesz bases, second ed.; Birkhäuser, New York, 2016.
  7. Debernardi, A.; Lev, N. Riesz bases of exponentials for convex polytopes with symmetric faces. J. Eur. Math. Soc. 2022, 24(no. 8), 3017–3029. [Google Scholar] [CrossRef]
  8. Kadec, M. I. The exact value of the Paley–Wiener constant. Dokl. Akad. Nauk SSSR Russian); English translation in Soviet Math. Dokl. 5 (1964). 155 (1964)(no. 6), 1253–1254 559–561.
  9. Kozma, G.; Nitzan, S. Combining Riesz bases. Invent. Math. 2015, 199(no. 1), 267–285. [Google Scholar] [CrossRef]
  10. Kozma, G.; Nitzan, S. Combining Riesz bases in Rd. Rev. Mat. Iberoam. 2016, 32(no. 4), 1393–1406. [Google Scholar] [CrossRef]
  11. Kozma, G.; Nitzan, S.; Olevskii, A. A set with no Riesz basis of exponentials. Rev. Mat. Iberoam. 2023, 39(no. 6), 2007–2016. [Google Scholar] [CrossRef]
  12. Lee, D. G. Unions of exponential Riesz bases. AIMS Math. 2024, 9(no. 9), 23890–23908. [Google Scholar] [CrossRef]
  13. Lee, D. G.; Pfander, G. E.; Walnut, D. Exponential bases for parallelepipeds with frequencies lying in a prescribed lattice. Results Math. 2024, 79(no. 6), 238. [Google Scholar] [CrossRef]
  14. Loukaki, M. Chebotarev’s theorem for cyclic groups of order pq and an uncertainty principle. Bull. Lond. Math. Soc. 2025, 57(no. 12), 3841–3856. [Google Scholar] [CrossRef]
  15. Matei, B.; Meyer, Y. A variant of compressed sensing. Rev. Mat. Iberoam. 2009, 25(no. 2), 669–692. [Google Scholar] [CrossRef]
  16. Ortega-Cerdà, J. There are no Riesz bases of exponentials in balls and triangles. arXiv 2026, arXiv:2609.18426. [Google Scholar]
  17. Pfander, G. E.; Revay, S.; Walnut, D. Exponential bases for partitions of intervals. Appl. Comput. Harmon. Anal. 2024, 68, article 101607. [Google Scholar] [CrossRef]
  18. Schmidt, W. M. Diophantine Approximation. In Lecture Notes in Math. 785; Springer, 1980. [Google Scholar]
  19. Seip, K. A simple construction of exponential bases in L2 of the union of several intervals. Proc. Edinb. Math. Soc. (2) 1995, 38(no. 1), 171–177. [Google Scholar] [CrossRef]
  20. Wan, Z. Sets with no Riesz bases of exponentials. arXiv 2026, arXiv:2609.16674. [Google Scholar]
  21. R. M. Young, An Introduction to Nonharmonic Fourier Series, revised first ed.; Academic Press: San Diego, 2001.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.