WorksMathematics
Sums and Products in Dynamically Central Syndetic Sets
Abstract
Glasscock and Le introduced the notion dynamically central syndetic sets in a minimal topological dynamical system under the minimal action of the semigroup In this short note, we introduce these large sets in the semigroup and establish that dynamically central syndetic sets contain the Hindman configuration . Furthermore, we show that there are dynamically central piecewise syndetic sets that do not contain such configurations.
Introduction
The interaction between addition and multiplication is of particular interest in Ramsey theory. While classical results in Ramsey theory guarantee the existence of monochromatic additive or multiplicative configurations under finite colourings, the simultaneous occurrence of both types of operation often requires substantially stronger arguments. In this connection, the Hindman’s Conjecture is one of cornerstones, and several variants of it have been the subject of recent attention in [1, 2, 3, 5, 6, 9, 10, 13, 14, 15].
Conjecture (Hindman [11]). Any finite coloring of contains monochromatic sets of the form .
This problem illustrates the difficulty of understanding the relationship between additive and multiplicative structures in the natural numbers.
A different approach to studying the existence of such configurations is through notions of combinatorial largeness arising from topological dynamics. In this direction, Glasscock and Le introduced and developed the notion of dynamically central syndetic sets in their work [7, 8] and the Combinatorics of Syndetic, Idempotent Filters. Their work establishes a connection between topological dynamics and the algebraic structure of families of subsets of . In particular, they characterize dynamically central syndetic sets in terms of membership in syndetic, idempotent filters. This characterization provides a useful framework for understanding the combinatorial properties of these sets. In this regard, recall a few definitions as follows.
Definition 1.1. (1) Let be a minimal topological dynamical system if is a compact metric space and is a continuous map such that every forward orbit is dense, that is, for all .
(2) For and a nonempty open set , the return-time set is
Thus, dynamically central syndetic sets inherit a strong form of combinatorial richness from the underlying dynamical structure. This makes them natural objects for investigating the existence of arithmetic configurations. We denote the family of dynamically (central) syndetic sets as ().
The dual of a family of subsets of is
Dual of the family of dynamically syndetic sets are the family of dynamically thick () and dual of the family of dynamically central syndetic sets are the family of dynamically central thick () sets. Thick sets are the subsets of that contain arbitrary long intervals, are the most immediate examples of dynamically thick sets. The family of sets formed by intersections of dynamically (central) syndetic and dynamically (central) thick sets are called dynamically piecewise syndetic (dynamically central piecewise syndetic) sets. We write and for these two families, respectively. For further examples of these sets are given in [7, 8].
Motivated by these developments, in multiplicative setting, a minimal multiplicative system is a compact metric space with a minimal action of by continuous maps , satisfying . For and open put . A set is dynamically central syndetic in if for some minimal multiplicative system, some open and some . A set is multiplicatively syndetic if there is a finite with , and multiplicatively central if it is central in the semigroup [12 Definition 19.20]. The family of central sets is denoted by . Similarly, one can define the families , , , and , and their respective duals for the multiplicative setting. The following diagram explains their relations:
Figure 1. ; ; ; ; ; ; ; ; ; ; ; ; ; ; .
We investigate whether dynamically central syndetic sets necessarily contain configurations involving both addition and multiplication. Our main result gives an affirmative answer to this question.
Theorem A. Every dynamically central syndetic subset of contains such that .
Proof. See Theorem 2.3. □
The theorem establishes that the dynamical structure underlying a dynamically central syndetic set is sufficiently rich to guarantee the simultaneous occurrence of an additive and a multiplicative configuration.
Further, we show that there is a set in avoiding the Hindman configurations for any .
Dynamically Central Syndetic Sets and the Pattern `
We show that every dynamically central syndetic subset of contains the configuration . We use the following result.
Proposition 2.1. Let be a finite set of integral polynomials without constant coefficients. Any subset of that is both multiplicatively syndetic and multiplicatively central contains subsets of the form .
Proof. See [1 Proposition 3.7]. □
Lemma 2.2. Every dynamically central syndetic set in is multiplicatively syndetic and multiplicatively central.
Proof. Let be a dynamically central syndetic set in . Then by definition, there exists a minimal multiplicative system with a compact metric space , and there exists an open set in and , such that .
We first show the multiplicatively syndeticity of . Since is minimal, so for each the orbit is dense, so for some . Thus . Since is compact, there exists a finite subset such that .
Given , consider the continuous map . There is a with . Since the dynamical system is multiplicative, hence , so , that is, . This proves that (and ) is syndetic.
Next, we show that is multiplicatively central. Note that every point of a minimal system is uniformly recurrent [4 Theorem 1.15], and is proximal to itself; since , the dynamical characterization of central sets in countable semigroups [12 Theorem 19.27] shows that , hence , is multiplicatively central in . □
Theorem 2.3. Let be a dynamically central syndetic set in the semigroup and let be a finite set of integral polynomials without constant coefficients. Then there exist such that .
Proof. By Lemma 2.2, is multiplicatively syndetic and multiplicatively central, and Proposition 2.1 applies. □
Corollary 2.4. Let be a dynamically central syndetic set in the semigroup . Then there exist such that .
Proof. Apply Theorem 2.3 with , . □
Remark 2.5. The configuration is the one Hindman’s conjectured to be partition regular. Theorem 2.3 does not bear directly on that conjecture, because is not partition regular.
Proposition 2.6. The family is not partition regular in or in .
Proof. We first show that the family is not partition regular in . To prove this, let us consider a 2-colouring on given by
For this colouring, both the pieces and are not syndetic.
Next for the remaining part, we consider the semigroup homomorphism , where the number of prime factors of counted with multiplicity. Then the composition
gives a coloring of . Using a similar argument, one may prove that none of the pieces and are syndetic. □
The hypothesis of Theorem 2.3 cannot be weakened to the corresponding piecewise syndetic notion, even if one asks for largeness in both semigroup structures at once.
Definition 2.1. Let be finite subsets of with . For odd let with . For even let with prime. Put .
Proposition 2.7. The set is thick in both and .
Proof. The first holds because of the odd blocks. For the second, given a finite , take an even ; then . A thick set meets every syndetic set, so in either semigroup meets every dynamically central syndetic set; that is, is a set of pointwise recurrence. Hence lies in in both and . It is also central in both, since thick sets are central [12 Theorem 4.48]. □
Now we are in a position to show that the above constructed set does not contain any Hindman configuration.
Corollary 2.8. The set contains no configuration .
Proof. Suppose with and . Then and , and both are at most . Hence . Case I. If , then . Thus does not belong to . This is a contradiction.
Case II. If , then divides and , hence . Every element of an earlier block is smaller than , so . Writing and , we get with , so . This is also a contradiction.
Hence we derive that the set does not contain the pattern for any choice of .
Current address: Department of Mathematics, University of Haifa, Israel
Email address: [email protected]
References
- [1]R. Alweiss, M. Bowen, and M. Sabok, Sums, Products, and Exponents in two-colorings of the naturals, arxiv.org/pdf/2512.09598, 2025.arxiv.org/abs/2512.09598
- [2]M. Bowen, Monochromatic products and sums in 2-colorings of ℕ, Advances in Mathematics, 462(2025) 110095.DOI
- [3]M. Bowen, M. Sabok, Monochromatic products and sums in the rationals, Forum of Mathematics, Pi(2024). vol.12:e17 1-12.DOI
- [4]H. Furstenberg, Recurrence in Ergodic Theory and Combinatorial Number Theory, Princeton University Press, Princeton, N.J., 1981.DOI
- [5]V. Bergelson, J. Moreira, Ergodic theorem involving additive and multiplicative groups of a field and patterns, Ergod. Theory Dyn. Syst., 37(3)(2017)673-692.
- [6]V. Bergelson, J. Moreira, Measure preserving actions of affine semigroups and patterns, Ergod. Theory Dyn. Syst., 38(2)(2018) 473-498.
- [7]D. Glasscock and A. N. Le, Dynamically syndetic sets and the combinatorics of syndetic, idempotent filters, https://arxiv.org/pdf/2408.12785, 2025.
- [8]D. Glasscock and A. N. Le, On sets of pointwise recurrence and dynamically thick sets, Ergodic Theory and Dynamical Systems, to appear.
- [9]L. Goldoni, A note on monochromatic solutions of a second degree system, Available at the author’s website, https://sites.google.com/site/professorlucagoldoni/pubblicazioni?authuser=0.
- [10]B. Green, T. Sanders, Monochromatic sums and products, Discrete Anal. (2016) 613.DOI
- [11]N. Hindman, Partitions and sums and products of integers, Trans. Am. Math.Soc. 247 (1979) 227-245.DOI
- [12]N. Hindman and D. Strauss, Algebra in the Stone–Čech Compactification: Theory and Applications, 2nd ed., de Gruyter, Berlin, 2012.
- [13]J. Moreira, Monochromatic sums and products in ℕ, Ann. Math.(2017) 1069-1090.arxiv.org/abs/1605.01469
- [14]S. Prendiville, Counting monochromatic solutions to diagonal Diophantine equations, Discrete Anal. (2021) 28173.arxiv.org/abs/2003.10161
- [15]J. Sahasrabudhe, Exponential patterns in arithmetic Ramsey theory, Acta Arith. 182(2018) 13-42.arxiv.org/abs/1607.08396
