betaFeedback

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 (N,+).(\mathbb{N}, +). In this short note, we introduce these large sets in the semigroup (N,⋅)(\mathbb{N}, \cdot) and establish that dynamically central syndetic sets contain the Hindman configuration {x,y,x+y,xy}\{x,y,x+y,xy\}. 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 N\mathbb{N} contains monochromatic sets of the form {x,y,xy,x+y}\{x,y,xy,x+y\}.

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 (N,+)(\mathbb{N},+). 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 (X,T)(X,T) be a minimal topological dynamical system if XX is a compact metric space and T:X→XT:X\to X is a continuous map such that every forward orbit is dense, that is, {Tnx:n≥1}≅X\{T^n x:n\geq1\}\cong X for all x∈Xx\in X.

(2) For x∈Xx\in X and a nonempty open set U⊆XU\subseteq X, the return-time set is

R(x,U):={n∈N:Tnx∈U}.R(x,U):=\{n\in\mathbb{N}:T^n x\in U\}.
A⊆N is dynamically syndetic if A⊇R(x,U) for some minimal system (X,T), some x∈X and some nonempty open U.(1)A \subseteq\mathbb{N} \text{ is dynamically syndetic if } A \supseteq R(x,U) \text{ for some minimal system } (X,T), \text{ some } x \in X \text{ and some nonempty open } U. \tag*{(1)}
If moreover x∈U, then A is dynamically central syndetic. We write dS and dcS for these two families.(2)\text{If moreover } x \in U, \text{ then } A \text{ is dynamically central syndetic. We write } dS \text{ and } dcS \text{ for these two families.} \tag*{(2)}

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 dSdS (dcSdcS).

The dual of a family F\mathcal{F} of subsets of N\mathbb{N} is

F∗:={B⊆N∣∀A∈F,B∩A≠∅}\mathcal{F}^{*} := \{B \subseteq\mathbb{N} \mid\forall A \in\mathcal{F}, B \cap A \ne\varnothing\}

Dual of the family of dynamically syndetic sets are the family of dynamically thick (dTdT) and dual of the family of dynamically central syndetic sets are the family of dynamically central thick (dcTdcT) sets. Thick sets are the subsets of N\mathbb{N} 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 dPSdPS and dcPSdcPS 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 XX with a minimal action n↦Tnn \mapsto T_n of (N,⋅)(\mathbb{N}, \cdot) by continuous maps TnT_n, satisfying Tnm=TnTmT_{nm} = T_nT_m. For x∈Xx \in X and open U⊆XU \subseteq X put R(x,U)={n∈N:Tnx∈U}R(x,U) = \{n \in\mathbb{N} : T_nx \in U\}. A set A⊆NA \subseteq\mathbb{N} is dynamically central syndetic in (N,⋅)(\mathbb{N}, \cdot) if A⊇R(x,U)A \supseteq R(x,U) for some minimal multiplicative system, some open UU and some x∈Ux \in U. A set AA is multiplicatively syndetic if there is a finite F⊆NF \subseteq\mathbb{N} with ⋃t∈F{n:tn∈A}=N\bigcup_{t \in F}\{n : tn \in A\} = \mathbb{N}, and multiplicatively central if it is central in the semigroup (N,⋅)(\mathbb{N}, \cdot) [12 Definition 19.20]. The family of central sets is denoted by C\mathcal{C}. Similarly, one can define the families dTdT, dcTdcT, dPSdPS, and dcPSdcPS, and their respective duals for the multiplicative setting. The following diagram explains their relations:

Figure 1. PS∗=dPS∗\mathcal{PS}^{*} = d\mathcal{PS}^{*}; T\mathcal{T}; dT∗d\mathcal{T}^{*}; dcT∗dc\mathcal{T}^{*}; dcPS∗dc\mathcal{PS}^{*}; c∗c^{*}; dcSdc\mathcal{S}; dCd\mathcal{C}; dcTdc\mathcal{T}; cc; dCd\mathcal{C}; dcPSdc\mathcal{PS}; S\mathcal{S}; dSd\mathcal{S}; PS=dPS\mathcal{PS} = d\mathcal{PS}.

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 DD of N\mathbb{N} contains x,y∈Nx,y \in\mathbb{N} such that {x,y,x+y,xy}⊆D\{x,y,x+y,xy\} \subseteq D.

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 dcPSdcPS set in N\mathbb{N} avoiding the Hindman configurations {x,y,xy,x+y}\{x,y,xy,x+y\} for any x,yx,y.

Dynamically Central Syndetic Sets and the Pattern {x,y,xy,x+y}\{x,y,xy,x+y\}`

We show that every dynamically central syndetic subset of (N,⋅)(\mathbb{N},\cdot) contains the configuration {x,y,xy,x+y}\{x,y,xy,x+y\}. We use the following result.

Proposition 2.1. Let PP be a finite set of integral polynomials without constant coefficients. Any subset of N\mathbb{N} that is both multiplicatively syndetic and multiplicatively central contains subsets of the form {x,y,xy,x+p(y):p∈P}\{x,y,xy,x+p(y):p \in P\}.

Proof. See [1 Proposition 3.7]. □

Lemma 2.2. Every dynamically central syndetic set in (N,⋅)(\mathbb{N},\cdot) is multiplicatively syndetic and multiplicatively central.

Proof. Let AA be a dynamically central syndetic set in (N,⋅)(\mathbb{N},\cdot). Then by definition, there exists a minimal multiplicative system (X,(N,⋅))(X,(\mathbb{N},\cdot)) with a compact metric space XX, and there exists an open set UU in XX and x∈Ux \in U, such that R(x,U)⊆AR(x,U) \subseteq A.

We first show the multiplicatively syndeticity of AA. Since (X,(N,⋅))(X,(\mathbb{N},\cdot)) is minimal, so for each y∈Xy \in X the orbit {Tny:n∈N}\{T_ny:n \in\mathbb{N}\} is dense, so y∈Tt−1Uy \in T_t^{-1}U for some tt. Thus X=⋃t∈NTt−1UX=\bigcup_{t\in\mathbb{N}}T_t^{-1}U. Since XX is compact, there exists a finite subset F⊆NF \subseteq\mathbb{N} such that X=⋃t∈FTt−1UX=\bigcup_{t\in F}T_t^{-1}U.

Given n∈Nn \in\mathbb{N}, consider the continuous map Tn:X=⋃t∈FTt−1U→X=⋃t∈FTt−1UT_n:X=\bigcup_{t\in F}T_t^{-1}U \to X=\bigcup_{t\in F}T_t^{-1}U. There is a t∈Ft \in F with Tnx∈Tt−1UT_nx \in T_t^{-1}U. Since the dynamical system is multiplicative, hence Ttnx∈UT_{tn}x \in U, so tn∈R(x,U)⊆Atn \in R(x,U) \subseteq A, that is, n∈t−1R(x,U)⊆t−1An \in t^{-1}R(x,U) \subseteq t^{-1}A. This proves that R(x,U)R(x,U) (and AA) is syndetic.

Next, we show that AA is multiplicatively central. Note that every point of a minimal system is uniformly recurrent [4 Theorem 1.15], and xx is proximal to itself; since x∈Ux \in U, the dynamical characterization of central sets in countable semigroups [12 Theorem 19.27] shows that R(x,U)R(x,U), hence AA, is multiplicatively central in (N,⋅)(\mathbb{N},\cdot). □

Theorem 2.3. Let A⊆NA \subseteq\mathbb{N} be a dynamically central syndetic set in the semigroup (N,⋅)(\mathbb{N},\cdot) and let PP be a finite set of integral polynomials without constant coefficients. Then there exist x,y∈Nx,y \in\mathbb{N} such that {x,y,xy,x+p(y):p∈P}⊆A\{x,y,xy,x+p(y):p \in P\} \subseteq A.

Proof. By Lemma 2.2, AA is multiplicatively syndetic and multiplicatively central, and Proposition 2.1 applies. □

Corollary 2.4. Let A⊆NA \subseteq\mathbb{N} be a dynamically central syndetic set in the semigroup (N,⋅)(\mathbb{N},\cdot). Then there exist x,y∈Nx,y \in\mathbb{N} such that {x,y,xy,x+y}⊆A\{x,y,xy,x+y\} \subseteq A.

Proof. Apply Theorem 2.3 with P={p}P=\{p\}, p(y)=yp(y)=y. □

Remark 2.5. The configuration {x,y,xy,x+y}\{x,y,xy,x+y\} is the one Hindman’s conjectured to be partition regular. Theorem 2.3 does not bear directly on that conjecture, because dcSdcS is not partition regular.

Proposition 2.6. The family dcSdcS is not partition regular in (N,+)(\mathbb{N},+) or in (N,⋅)(\mathbb{N},\cdot).

Proof. We first show that the family dcSdcS is not partition regular in (N,+)(\mathbb{N},+). To prove this, let us consider a 2-colouring on (N,+)(\mathbb{N},+) given by

c:(N,+)→{0,1}n↦⌈log⁡2(n)⌉(mod2).c:(\mathbb{N},+) \to\{0,1\} \qquad n \mapsto\lceil\log_2(n)\rceil\pmod2.

For this colouring, both the pieces c−1(0)=⋃m≥0[22m,22m+1)c^{-1}(0)=\bigcup_{m\ge0}[2^{2m},2^{2m+1}) and c−1(1)=⋃m≥0[22m+1,22m+2)c^{-1}(1)=\bigcup_{m\ge0}[2^{2m+1},2^{2m+2}) are not syndetic.

Next for the remaining part, we consider the semigroup homomorphism Ω:(N,⋅)→(N,+)\Omega:(\mathbb{N},\cdot)\to(\mathbb{N},+), where Ω(n)\Omega(n) the number of prime factors of nn counted with multiplicity. Then the composition

cˉ:=c∘Ω:(N,⋅)→{0,1}n↦⌈log⁡2(Ω(n))⌉(mod2)\bar{c}:=c\circ\Omega:(\mathbb{N},\cdot)\to\{0,1\} \qquad n\mapsto\lceil\log_2(\Omega(n))\rceil\pmod2

gives a coloring of (N,⋅)(\mathbb{N},\cdot). Using a similar argument, one may prove that none of the pieces cˉ−1(0)\bar{c}^{-1}(0) and cˉ−1(1)\bar{c}^{-1}(1) 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 B1,B2,…B_1,B_2,\ldots be finite subsets of {2,3,…}\{2,3,\ldots\} with min⁡Bs+1>(max⁡Bs)2\min B_{s+1}>(\max B_s)^2. For odd kk let Bk=[Nk,Nk+k]B_k=[N_k,N_k+k] with Nk>kN_k>k. For even kk let Bk=qk⋅{1,…,k}B_k=q_k\cdot\{1,\ldots,k\} with qk>kq_k>k prime. Put A=⋃kBkA=\bigcup_k B_k.

Proposition 2.7. The set AA is thick in both (N,+)(\mathbb{N},+) and (N,⋅)(\mathbb{N},\cdot).

Proof. The first holds because of the odd blocks. For the second, given a finite FF, take an even k≥max⁡Fk\ge\max F; then F⋅qk⊆AF\cdot q_k\subseteq A. A thick set meets every syndetic set, so in either semigroup AA meets every dynamically central syndetic set; that is, AA is a set of pointwise recurrence. Hence A=N∩AA=\mathbb{N}\cap A lies in dcPSdcPS in both (N,+)(\mathbb{N},+) and (N,⋅)(\mathbb{N},\cdot). 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 AA does not contain any Hindman configuration.

Corollary 2.8. The set AA contains no configuration {x,y,xy,x+y}\{x,y,xy,x+y\}.

Proof. Suppose 2≤x≤y2\le x\le y with y∈Bsy\in B_s and x+y,xy∈Ax+y,xy\in A. Then y<x+yy<x+y and y≤xyy\le xy, and both are at most (max⁡Bs)2<min⁡Bs+1(\max B_s)^2<\min B_{s+1}. Hence x+y,xy∈Bsx+y,xy\in B_s. Case I. If Bs=[N,N+k]B_s = [N, N + k], then xy≥2N>N+kxy \ge2N > N + k. Thus xyxy does not belong to BsB_s. This is a contradiction.

Case II. If Bs=q⋅{1,…,k}B_s = q \cdot\{1, \ldots, k\}, then qq divides yy and x+yx + y, hence xx. Every element of an earlier block is smaller than qq, so x∈Bsx \in B_s. Writing x=qax = qa and y=qby = qb, we get xy=q⋅(qab)xy = q \cdot(qab) with qab≥q>kqab \ge q > k, so xy∉Bsxy \notin B_s. This is also a contradiction.

Hence we derive that the set AA does not contain the pattern {x,y,xy,x+y}\{x,y,xy,x+y\} for any choice of x,yx,y.

Current address: Department of Mathematics, University of Haifa, Israel

Email address: [email protected]

References

  1. [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. [2]M. Bowen, Monochromatic products and sums in 2-colorings of ℕ, Advances in Mathematics, 462(2025) 110095.DOI
  3. [3]M. Bowen, M. Sabok, Monochromatic products and sums in the rationals, Forum of Mathematics, Pi(2024). vol.12:e17 1-12.DOI
  4. [4]H. Furstenberg, Recurrence in Ergodic Theory and Combinatorial Number Theory, Princeton University Press, Princeton, N.J., 1981.DOI
  5. [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. [6]V. Bergelson, J. Moreira, Measure preserving actions of affine semigroups and patterns, Ergod. Theory Dyn. Syst., 38(2)(2018) 473-498.
  7. [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. [8]D. Glasscock and A. N. Le, On sets of pointwise recurrence and dynamically thick sets, Ergodic Theory and Dynamical Systems, to appear.
  9. [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. [10]B. Green, T. Sanders, Monochromatic sums and products, Discrete Anal. (2016) 613.DOI
  11. [11]N. Hindman, Partitions and sums and products of integers, Trans. Am. Math.Soc. 247 (1979) 227-245.DOI
  12. [12]N. Hindman and D. Strauss, Algebra in the Stone–Čech Compactification: Theory and Applications, 2nd ed., de Gruyter, Berlin, 2012.
  13. [13]J. Moreira, Monochromatic sums and products in ℕ, Ann. Math.(2017) 1069-1090.arxiv.org/abs/1605.01469
  14. [14]S. Prendiville, Counting monochromatic solutions to diagonal Diophantine equations, Discrete Anal. (2021) 28173.arxiv.org/abs/2003.10161
  15. [15]J. Sahasrabudhe, Exponential patterns in arithmetic Ramsey theory, Acta Arith. 182(2018) 13-42.arxiv.org/abs/1607.08396

Paper details

vlnc:W_bqg8zpsk
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents