Sublacunary sets and interpolation sets for nilsequences
Abstract.
A set is an interpolation set for nilsequences if every bounded function on can be extended to a nilsequence on . Following a theorem of Strzelecki, every lacunary set is an interpolation set for nilsequences. We show that sublacunary sets are not interpolation sets for nilsequences. Furthermore, we prove that the union of an interpolation set for nilsequences and a finite set is an interpolation set for nilsequences. Lastly, we provide a new class of interpolation sets for Bohr almost periodic sequences, and as the result, obtain a new example of interpolation set for -step nilsequences which is not an interpolation set for Bohr almost periodic sequences.
1. Introduction
A Bohr almost periodic sequence is a uniform limit of trigonometric polynomials, i.e. the functions of the form where for . A subset of is an -set (or interpolation set for Bohr almost periodic sequences) if every bounded function on can be extended to a Bohr almost periodic sequence. Equivalently, every bounded function on is the restriction of the Fourier transform of a discrete measure on the torus . The class of -sets have been extensively studied in harmonic analysis since 1960s [12, 13, 21, 7]. One notable result is due to Strzelecki [23] where he showed that every lacunary set 111 with is lacunary if . is an -set. Recently, the author [16] proved that sublacunary sets are not -sets. Here with is sublacunary if .
Under the harmonic analytic point of view, Bohr almost periodic sequences are the Fourier transforms of discrete measures on . On the other hand, from the dynamical systems perspective, Bohr almost periodic sequences are the evaluations of continuous functions on the orbits of toral rotations. With this standpoint, Bergelson, Host and Kra [2] introduced a generalization of Bohr almost periodic sequences and named them nilsequences (See Section 2.1 for definition). Under this generalization, Bohr almost periodic sequences coincide with -step nilsequences. Since their introduction, nilsequences have become important objects in ergodic theory, arithmetic combinatorics and number theory. They are indispensable ingredients in the recent development in ergodic Ramsey theory [17, 4]. They also played prominent roles in the programs of finding linear patterns in primes [8, 9, 10], and more recently in the progress of Chowla and Sarnak’s conjectures [22, 24, 5].
Roughly speaking, interpolation sets for a class of sequences tell us which coordinates of the sequences that are pairwise independent. Hence, understanding their interpolation sets can shed light on the inherent structures of the family of sequences we are studying. Because of this reason and since nilsequences are important objects in various areas of mathematics, it is of interest to study interpolation sets for nilsequences. Here is the precise definition.
Definition 1.1.
A set is called an interpolation set for -step nilsequences (or -step interpolation set) if for every bounded function , there exists a -step nilsequence such that for .
A set is called an interpolation set for nilsequences if is a -step interpolation set for some .
Since Bohr almost periodic sequences are -step nilsequences, every set is an interpolation set for nilsequences. Therefore, following from Strzelecki’s result [23], lacunary set are interpolation sets for nilsequences. In [16], the author asked whether there is a sublacunary set that is an interpolation set for nilsequences. The main result of this paper give a negative answer to that question.
Theorem 1.2.
Sublacunary sets are not interpolation sets for nilsequences.
It was shown in [21] that the class of -sets is closed under the unions with finite sets. Here we prove an analogous result regarding interpolation sets for nilsequences.
Theorem 1.3.
If is a -step interpolation set and is finite, then is a -step interpolation set.
Known examples of -sets include lacunary sets and some suitable unions of lacunary sets, like . In the next proposition, we provide a new example of -set.
Proposition 1.4.
Let be lacunary and let be such that . Then is an -set if and only if is not a set of Bohr recurrence.222A set is a set of Bohr recurrence if and only if for any finite dimensional torus and any , we have is in the closure of . For example, the set of even natural numbers is a set of Bohr recurrence, but the set of odd natural numbers is not.
From Proposition 1.4, we have following examples of -sets: , and . The class of Bohr almost periodic sequences is strictly contained in the class of -step nilsequences. In [16] we provided an example of -step interpolation set that is not an -set. As a corollary of Proposition 1.4, we obtain another example for set of this type.
Corollary 1.5.
Let be lacunary. Let be such that and is a set of Bohr recurrence. Then is a -step interpolation set but not an -set.
Using Proposition 1.4, we also derive a different proof of Corollary 2.7.9 in [7] which says that the sum of a lacunary set and a finite set is an -set (Corollary 5.2).
2. Background
2.1. Nilsequences
Let be a -step nilpotent Lie group and be a discrete, cocompact subgroup. The homogeneous space is called a -step nilmanifold. For any , the map defined by is a diffeomorphism and the pair is called a -step nilsystem.
For and a continuous function on , the sequence is called a basic -step nilsequence. Examples of basic -step nilsequences include where , or more generally, where of degree not greater than .
A sequence is a -step nilsequence if for every , there exists a basic -step nilsequence such that for all . In other words, a -step nilsequence is a uniform limit of basic -step nilsequences.
The space of -step nilsequences is closed under pointwise addition, multiplication, complex conjugation and uniform limits.
2.2. Special representations of nilsequences
We can always embed a -step nilmanifold into a -step nilmanifold where is connected and simply connected and every element of is represented in (for example, see [14, Corollary 26, Section 10.5.1]). Therefore, every -step nilsequence can be realized from a -step nilmanifold with a connected and simply connected Lie group.
2.3. Characterization of -sets
For and , let denote the closure of in .
Two sets are said to be separable by a Bohr rotation if there exists a finite dimensional torus and an element such that .
Theorem 2.1 (Hartman-Ryll-Nardzewski [13]).
A set is an -set if and only if every two disjoint subsets of are separable by a Bohr rotation.
Strzelecki [23] proved that all lacunary sets are -sets. By Hartman-Ryll-Nardzewski characterization [13], some unions of lacunary sets are -sets, for example, . In fact, it is shown in [7] that any finite union of shifts of lacunary sets is an -set, for instance, . Grow [11] constructed a class of -sets which are not finite unions of lacunary sets, for example, (see also Méla [19]). More information on -sets can be found in the book [7] by Graham and Hare.
2.4. Characterization of interpolation sets for nilsequences
For , for a -step nilsystem and , let denote the set and let denote the closure of in .
Definition.
Two sets are said to be separable by a -step nilrotation if there exists a -step nilsystem and such that .
Analogous to Hartman-Ryll-Nardzewski’s criterion [13], we have a characterization of -step interpolation sets and its proof is identical to [16, Theorem 3.1].
Theorem 2.2.
The set is a -step interpolation set if and only if every two disjoint subsets of are separable by a -step nilrotation.
2.5. Sets of pointwise nilrecurrence
Definition 2.3.
A set is called a set of pointwise -step nilrecurrence if for any -step nilsystem and for any , we have .
Let be the natural quotient map . Let be the identity element of and . In Definition 2.3, by changing the base point to , we have an equivalent definition: is a set of pointwise -step nilrecurrence if and only if for any -step nilsystem , we have .
For any , the set is a set of pointwise -step nilrecurrence. Other than that, little is known about sets of pointwise nilrecurrence. However, there is a related and better-studied notion called sets of topological -step nilrecurrence. A set is called a set of topological -step nilrecurrence if for any -step nilsystem and for any open, there exists such that .333Usually when defining sets of topological recurrence, we restrict to minimal systems. However, as every orbit closure in nilsystems is minimal, we do not need this restriction here. It is proved in [15] that a set is a set of topological -step nilrecurrence if and only if it is a set of Bohr recurrence.
It is obvious that every set of pointwise -step nilrecurrence is a set of topological -step nilrecurrence. But the converse is probably false (See [20].) For example, while is a set of topological nilrecurrence, it is not clear whether it is a set of pointwise -step nilrecurrence or not.
2.6. Nilmanifolds and Mal’cev bases
Let be a -step nilmanifold with connected and simply connected . If is the dimension of and is the Lie algebra of , then admits a base satisfying the following properties:
-
(1)
The map defined by
is a diffeomorphism from onto .
-
(2)
.
The base is called a Mal’cev basis of . If , then are called the Mal’cev coordinates of in the base .
For and , write
There exist polynomials with of degree at most such that for all ,
We have is a fundamental domain for . Hence, we can identify with through the diffeomorphism .
We then have a chain of maps:
and define to be . Equivalently, for , there exists a unique such that . Then we can see that . Further details on Mal’cev bases can be found in [18, 3] and [14, Chapter 10].
Definition 2.4.
For a real number , let denote the distance from to the nearest integer. For and , define
We can see that defines a metric on which is compatible with the Euclidean metric. The reason we choose this metric only to make our computations later less cumbersome. We use to denote the metric on that comes from the metric on through the map .
2.7. Notation
We use to denote the set of positive integers and use to denote the torus . The notation represents a sequence of complex numbers and represents a subset of with .
Let . By writing , we mean there exist positive constants and that depend on and such that for every .
3. Union of interpolation sets with finite sets
Lemma 3.1.
Let be a set of pointwise -step nilrecurrence and is a finite set. Then is still a set of pointwise -step nilrecurrence.
Proof.
By way of contradiction, assume is not a set of pointwise -step nilrecurrence. Then there exists a -step nilsystem such that
Let be an irrational number. Since is finite, we have . Consider the -step nilsystem . It then follows that the closure
does not contain . Therefore is not a set of pointwise -step nilrecurrence, and this is a contradiction. ∎
Lemma 3.2.
Let be a set of pointwise -step nilrecurrence. Let be a -step nilmanifold with the corresponding metric . Suppose is a compact subset of . For every , there exists a finite set such that the following holds: For all , there exists for which .
Proof.
Suppose . By contradiction, assume there exists such that for all , there exists satisfying
Since is compact, the sequence has an accumulation point in , say . It follows that
But this contradicts the hypothesis that is a set of pointwise -step nilrecurrence. ∎
Lemma 3.3.
A set of pointwise -step nilrecurrence can be partitioned into two sets of pointwise -step nilrecurrence.
Proof.
It is well-known that up to isomorphism, the set of pair where is a -step nilpotent Lie group and is a discrete, cocompact subgroup is countable (for example see [14, Section 10.5.2]). Let be a set of representatives of those non-isomorphic pairs . For each , we can partition into countably many compact subsets, say . It follows that the set is countable. Enumerate as .
Let be a set of pointwise -step nilrecurrence. Invoking Lemma 3.2, there exists a finite set such that for every , there exists for which
(1) |
Since is finite, by Lemma 3.1, is still a set of pointwise -step nilrecurrence. Using Lemma 3.2 again, we can find a finite set for which for every , there exists satisfying (1).
Removing and from and applying above procedure repeatedly, we get two sequences of pairwise disjoint subsets of , say and , such that the following holds: For every , there exists and for which
and
Let and . By construction, and are disjoint subset of . It remains to show that and are sets of pointwise -step nilrecurrence.
By definition of , for any -step nilmanifold , every and , there is an such that is isomorphic to , and under this isomorphism and . Therefore, there exists such that . Because is arbitrary, we deduce that is a set of pointwise recurrence for the system . Since are arbitrary, we have is a set of pointwise -step nilrecurrence. Similar conclusion is true for . ∎
The following two lemmas are standard and their proofs are included for completeness.
Lemma 3.4.
Let . Suppose that is separable by some -step nilrotations from and . Then is separable by a -step nilrotation from .
Proof.
Let be a -step nilsystem such that . Let be a -step nilsystem such that . Considering the product system , we have
Therefore, and are separable by a -step nilrotation. ∎
Lemma 3.5.
If and are -step interpolation sets and they are separable by a -step nilrotation, then is a -step interpolation set.
Proof.
Let be two disjoint subsets of . Then and . Invoking Theorem 2.1, the sets and are separable by a -step nilrotation because they are disjoint subsets of a -step interpolation set . On the other hand, and are separable by a -step nilrotation because and are separable by a -step nilrotation. By Lemma 3.4, the sets and are separable by a -step nilrotation. Similarly, and are separable by a -step nilrotation. Invoking Lemma 3.4 again, we have and are separable by a -step nilrotation. Since and are two arbitrary disjoint subsets of , we get is a -step interpolation set by Theorem 2.1. ∎
We are ready to prove Theorem 1.3.
Proof of Theorem 1.3.
By induction, it suffices to assume for some . By contradiction, suppose is not -interpolation. Since both and are -interpolation, by Lemma 3.5, it follows that and are not separable by any -step nilrotation. Therefore, for every -step nilsystem , is in the closure of . Or equivalently, is in the closure of . Since is an arbitrary -step nilsystem, we conclude that is a set of pointwise -step nilrecurrence. In view of Lemma 3.3, the set can be partitioned into two sets of pointwise -step nilrecurrence, say and . Hence, for every -step nilsystem , we have
Or equivalently,
In particular, is non-empty. Since is an arbitrary -step nilsystem, we deduce that and are not separable by any -step nilrotation. Hence, by Theorem 2.1, the set is not -step interpolation. This is a contradiction. ∎
4. Sublacunary sets and interpolation sets
4.1. Partitioning a compact set by a system of polynomial equations
Lemma 4.1.
Let and of degree at most . Then the union of the solutions sets of equations for divides into less than regions.
Remark 1.
As an illustration of the lemma above, let of degree at most . Then for each the solution set of is a conic section. It is easy to see that the number of regions that two conic sections divide into is not exceeding , which is less than (The maximum number is achieved when we have two hyperbolas.)
Proof.
On the boundary of every region, there is a point which is a solution to a system of the form
where distinct. By Bézout’s theorem, each system has maximum solutions counting with multiplicity and counting also . There are such systems. Hence, there are less than points in that are solutions of one of those systems.
Each point is on the boundaries of at most regions where each region is corresponding to a choice of or for . It follows that there are at most regions. ∎
For the rest of Section 4.1, we fix a -step nilmanifold with being connected and simply connected. Assume and the multiplication rule on the Mal’cev coordinates is the following:
(2) |
where for , the polynomial has degree at most . We also fix the maps and accordingly as they are defined in Section 2.6.
All constants and big-O terms found in this section implicitly depend on , the choice of Mal’cev’s basis, maps , and polynomials .
Lemma 4.2.
There exists having all coefficients non-negative and for , there exist satisfying the followings:
-
(a)
For every ,
(3) -
(b)
For and , the polynomial has degree less than .
-
(c)
For and , the sum of absolute values of coefficients of is bounded above by .
Proof.
The existence of satisfying (3) follows from the multiplication rule on Mal’cev coordinates. By induction, we can compute explicitly.
In general, for and ,
It also follows that
By induction, we get . Since , we have
It remains to prove . Let with the coefficients for any monomial being the maximum of the absolute values of coefficients for corresponding monomials in any of . For , , define polynomials recursively as follows: , and for ,
Then all the coefficients of are non-negative and greater than or equal to the absolute value of the corresponding coefficients in .
Now the sum of coefficients of is equal to
(4) |
From above formula, it is not hard to see that and for all and . Hence the right hand side of (4) is not greater than
Define by . We then have
for all and . By induction,
where the polynomial is repeated times. Let where polynomial is repeated times. Then we have . This finishes our proof. ∎
In the rest of Section 4.1, we fix polynomials (for and ) found in Lemma 4.2.
Proposition 4.3.
For , let be the unique element in be such that . There exists a constant such that
as .
Proof.
Using (2), we can compute explicitly.
where means taking integer parts. In general, for ,
Let . Since for every , it follows that
Inductively, we can show that for . Letting , we have our conclusion. ∎
Corollary 4.4.
For and , let be such that . Let . Then there exists a constant such that the following is true: For and ,
Proof.
By Lemma 4.2, there exists polynomial such that
where of degree less than and the sum of absolute values of coefficients of is bounded above by . It follows that if , then
In view of Proposition 4.3, there exists a constant such that for ,
where . ∎
Proposition 4.5.
Let . There exists constant such that the following holds: For every , if are natural numbers, then the union of solutions of equations
(5) |
partition into regions.
Proof.
Suppose where for . By definition of the metric , for , solutions of the equation
are solutions of at least one of equations
(6) |
for .
Since all , solutions of (6) are solutions of at least one of two equations:
(7) |
Because , (7) is equivalent to
(8) |
By Corollary 4.4, there exists a constant such that for and , we have
and
By replacing and with possible integer values that they can take, the solution set of (8) is a subset of the union of solutions of equations:
(9) |
where are integers such that and for .
It follows that the union of solutions of equations in (5) is a subset of the union of solutions of polynomial equations
(10) |
where
and
for .
Since , we have . Moreover, because every has degree less than and every has degree less than , the left hand side of (10) is a polynomial of degree less than .
Observe that the number of regions that the union of solutions of equations in (5) partition is not greater than the following number: The number of regions that the union of solutions of equations that appear in (10) and of equations for partition . In total there are at most polynomial equations in which the degree of each polynomial is less than . According to Lemma 4.1, the number of regions that the union of solutions of these equations partition is less than
Letting , we have our conclusion. ∎
To state the next proposition, we need a definition.
Definition 4.6.
Let and . For , we say and are -separable by if
Proposition 4.7.
Let be a sublacunary set. Then for every compact and , there exist two finite disjoint subsets such that and are not -separable by any .
Proof.
By contradiction, assume there exist compact and such that every two finite disjoint subsets of are -separable by some . Since is compact, it is contained inside for some sufficiently large. Without loss of generality, assume .
Suppose . For , let . We say a subset an -nice set if and are -separable by some . By our assumption, every subset of is an -nice set. In other words, there are -nice sets. We will show this is impossible when is sufficiently large.
For an -nice set , there exists such that . Associate that to by saying creates . We will count number of -nice sets created by as ranges over .
For , the set is a finite subset of . Connect two elements of if their distance is less than . Since the metric on comes from the metric on , the number of connected components is not greater than .
If is an -nice set created by , then must solely consist of some of those connected components. More precisely, if such that and are in the same connected component, then must also belong to . (Otherwise, if , then on the connected path from to , there would be two adjacent points whose distance is less than but one belongs to while the other belongs to . This would contradict the assumption that .) Therefore, the number of -nice sets created by a fixed is at most the number of ways to pick connected components of , which is not greater than .
For , and create the same collection of -nice sets if for every ,
Or equivalently,
Consider equations for (In these equations, the unknown is ). The solutions of these equations partitions into disjoint regions. Note that the map is continuous, and hence, every in the same region creates the same collection of -nice sets. It remains to count the number of regions.
Let . Then the equation becomes
(11) |
Invoking Proposition 4.5, there is a constant such that the solutions of equations of the form (11) where with partition into regions.
Thus there are at most distinct -nice sets created by some . Since is sublacunary (i.e. as ),
It follows that for sufficiently large . This contradicts our assumption that there are always -nice sets for every of the form . ∎
4.2. Proof of the main theorem
We are ready to prove Theorem 1.2.
Proof of Theorem 1.2.
Let be a sublacunary set. By Theorem 2.1, it suffices to show that there exist two disjoint subset that are not separabe by any -step nilrotation.
Similar to the proof of Lemma 3.3, we use the fact that up to isomorphism, the set of pair where is a -step nilpotent Lie group and is a discrete, cocompact subgroup is countable. Let be a set of representatives of those non-isomorphic pairs . For each , we can partition into countably many compact subsets, say . It follows that the set is countable. Enumerate as .
By Proposition 4.7, there exist finite and disjoint that are not -separable by any . Let . Since are finite, is still sublacunary. Hence there exist finite and disjoint that are not -separable by any . In general, by induction, we obtain two sequences of finite and pairwise disjoint sets and such that for each , and are not -separable by any . Let and . Then and are disjoint subsets of by construction.
Note that if and are separable by a -step nilrotation, there must be an and a -step nilsystem such that and are -separable by . Since and , it follows from our construction that and are not separable by any nilrotation . Because nilrotations on represent all possible -step nilrotations, our proof finishes. ∎
5. New interpolation sets for Bohr almost periodic sequences
In this section, we prove Proposition 1.4 about new examples of -sets and the corresponding corollaries.
Proof of Proposition 1.4.
First of all, if is a set of Bohr recurrence, then and are not separable by any Bohr rotation. Hence, in view of Theorem 2.1, the set is not an -set.
Suppose is not a set of Bohr recurrence. Then there exists in some finite dimensional torus and such that for all . Cover by finitely many balls of diameter , say . Then for each , and must belong to two disjoint balls.
Partition into sets for as follows. First, let . Then, for each , if , let , and if let . Inductively, for , let and . For each , if , let , and if , let .
By construction, are pairwise disjoint. Moreover, since , we have . It follows that . Furthermore, since for every , and belong to two disjoint balls, there are no and such that both and are elements of . Hence, from our hypothesis that is lacunary and , each is lacunary. In particular, is an -set. To show that is , it remains to show that for distinct, and are separable by a Bohr rotation.
For distinct, there does not exist any such that both and belong to . (Since if , then from the construction, must belong to , not . Likewise, if , must be in , not .) Hence, the set is lacunary. Because every lacunary set is an -set, are separable by a Bohr rotation according to Theorem 2.1. By the same reason, and are separable by Bohr rotations.
For , while is in the complement of the ball having the same center as but with twice diameter. Hence, and have disjoint closures in . In particular, and are separable by .
We conclude that every two sets in are separable by a Bohr rotation. Therefore, is an -set. ∎
Corollary 5.1.
Let be lacunary and let be such that . Then is a -step interpolation set.
Proof.
Note that if is an -step nilsequence, is a -step nilsequence. It follows that a set is a -step interpolation set if is an -step interpolation set (See the proof of [16, Proposition 1.7]).
Let and satisfy the hypothesis of the corollary. Consider the set . Since and is increasing, we have
Because is lacunary, is also lacunary. Hence it is not a set of Bohr recurrence [6]. Furthermore, we also have
In view of Proposition 1.4, the set is an -set. From our discussion at the beginning, the set is a -step interpolation set. ∎
Corollary 1.5 now follows from Proposition 1.4 and Corollary 5.1. Next we obtain another corollary of Proposition 1.4.
Corollary 5.2 ([7, Corollary 2.7.9]).
Let be lacunary and let be finite. Then is an -set.
Proof.
By Hartman-Ryll-Nardzewski criterion (Theorem 2.1), it suffices to show and are separable by a Bohr rotation for any . But this follows from Proposition 1.4 with for . ∎
Remark 2.
In contrast with Corollary 5.2, it is not true in general that the sum of an -set and a finite set is an -set. For example, let . Then is an -set. However, is not an -set because and are not separable by any Bohr rotation.
6. Open questions
As shown in [16] and also Corollary 1.5, there are -step interpolation sets that are not -sets. It is natural to ask to what extent this feature holds for higher step nilsequences. The following question has been asked in [16] and is currently still open.
Question 6.1.
For , does there exist a -interpolation set that is not a -interpolations set?
A topological system with a metric on is called distal if for every distinct, . A distal sequence is a sequence of the form for where is a continuous function on a distal system and . It is shown in [1] that nilsystems are distal, therefore every nilsequence is a distal sequence. It is then of interest to study the notion of interpolation sets to distal sequences.
Definition 6.2.
A set is called an interpolation set for distal sequences if for every bounded function , there exists a distal sequence such that for .
Based on Theorem 1.2 and Theorem 1.3, there are two questions we can ask.
Question 6.3.
Let be an interpolation set for distal sequences and finite. Is it true that is an interpolation set for distal sequences?
Question 6.4.
Is it true that no sublacunary set is an interpolation set for distal sequences?
References
- [1] L. Auslander, L. Green, and F. Hahn. Flows on homogeneous spaces. With the assistance of L. Markus and W. Massey, and an appendix by L. Greenberg. Annals of Mathematics Studies, No. 53. Princeton University Press, Princeton, N.J., 1963.
- [2] V. Bergelson, B. Host, and B. Kra. Multiple recurrence and nilsequences. Invent. Math., 160(2):261–303, 2005. With an appendix by I. Ruzsa.
- [3] L. Corwin and F. Greenleaf. Representations of nilpotent Lie groups and their applications. Cambridge University Press, Cambridge, 1990.
- [4] N. Frantzikinakis and B. Host. Higher order Fourier analysis of multiplicative functions and applications. J. Amer. Math. Soc., 30(1):67–157, 2017.
- [5] N. Frantzikinakis and B. Host. The logarithmic Sarnak conjecture for ergodic weights. Ann. of Math. (2), 187(3):869–931, 2018.
- [6] H. Furstenberg. Poincaré recurrence and number theory. Bull. Amer. Math. Soc. (N.S.), 5(3):211–234, 1981.
- [7] C. Graham and K. Hare. Interpolation and Sidon sets for compact groups. CMS Books in Mathematics. Boston, MA: Springer US, 2013.
- [8] B. Green and T. Tao. Linear equations in primes. Ann. of Math., 171(3):1753–1850, 2010.
- [9] B. Green and T. Tao. The quantitative behaviour of polynomial orbits on nilmanifolds. Ann. of Math. (2), 175(2):465–540, 2012.
- [10] B. Green, T. Tao, and T. Ziegler. An inverse theorem for the Gowers -norm. Ann. of Math., 176(2):1231–1372, 2012.
- [11] D. Grow. A class of -sets. Collog. Math., 53(1):111–124, 1987.
- [12] S. Hartman. On interpolation by almost periodic functions. Colloq. Math., 8:99–101, 1961.
- [13] S. Hartman and C. Ryll-Nardzewski. Almost periodic extensions of functions. Colloq. Math., 12:23–39, 1964.
- [14] B. Host and B. Kra. Nilpotent structures in ergodic theory, volume 235 of Mathematical Surveys and Monographs. American Mathematical Society, 2018.
- [15] B. Host, B. Kra, and A. Maass. Variations on topological recurrence. Monatsh. Math., 179(1):57–89, 2016.
- [16] A. Le. Interpolation sets and nilsequences. Colloq. Math., 162(2):181–199, 2020.
- [17] A. Leibman. Nilsequences, null-sequences, and multiple correlation sequences. Ergodic Theory Dynam. Systems, 35(1):176–191, 2015.
- [18] A. Mal’cev. On a class of homogeneous spaces. Izvestiya Akad. Nauk. SSSR. Ser. Mat., 13:9–32, 1949.
- [19] J.-F. Méla. Approximation diophantienne et ensembles lacunaires. Bull. Soc. Math. France, Mem. 19:26–54, 1969.
- [20] R. Pavlov. Some counterexamples in topological dynamics. Ergodic Theory Dynam. Systems, 28(4):1291–1322, 2008.
- [21] C. Ryll-Nardzewski. Concerning almost periodic extensions of functions. Colloq. Math., 12:235–237, 1964.
- [22] P. Sarnak. Mobius randomness and dynamics. Not. S. Afr. Math. Soc., 43(2):89–97, 2012.
- [23] E. Strzelecki. On a problem of interpolation by periodic and almost periodic functions. Colloq. Math., 11:91–99, 1963.
- [24] T. Tao and J. Teräväinen. The structure of logarithmically averaged correlations of multiplicative functions, with applications to the Chowla and Elliott conjectures. Duke Math. J., 168(11):1977–2027, 2019.