WorksMathematics
Recurring differences from overlapping arithmetic progressions
Abstract
We give sufficient conditions for the signed differences occurring infinitely often in a set of natural numbers to have bounded gaps. The hypotheses use pairs of finite arithmetic progressions with coprime step quotients, positive normalized overlap, and bounded mutual distance. Bounded perturbations of the progressions are allowed. A finite circular-gap criterion gives the explicit bound , including equality at the overlap threshold. Exact centered pairs yield a finite-intersection theorem. Separated constructions realize these conditions at zero upper Banach density and give examples with no recurrent three-point pattern, no infinite arithmetic progression of recurrent differences, and infinitely many pairwise almost disjoint translates. Further examples describe the rational limiting threshold and the order of the quantitative gap bound.
Introduction and main results
For , define its signed recurrent difference set by
A set is syndetic if some positive integer satisfies
We call such an a gap bound. Erdős and Graham asked for conditions ensuring this property for , and also considered finite intersections of recurrent difference sets [1 p. 50]. Positive upper Banach density is a classical sufficient condition, including for finite intersections [5, 4]. Sparse sufficient conditions arise in the work of Leth and Goldbring–Leth [3, 2]. The conditions below concern the steps, lengths, overlap, and relative positions of finite progression pairs.
Fix . For each , let
where , , and
Write and for the real convex hulls of and , and put . We assume that, for a fixed integer ,
For and , let be the largest circular gap between the distinct points of
The gap of a singleton is 1.
(1) There are and such that, for infinitely many ,
(2) Fix . Let be congruent to modulo , and let satisfy . Put . For infinitely many , assume
Then is a gap bound for .
The second condition is non-strict. In particular, its conclusion includes models whose normalized overlap equals the largest circular gap. The first condition also permits contacts at endpoints of the overlapping hulls.
Theorem 1.2. Let . For each , suppose contains the exact progression pairs
Assume their minimum points tend to infinity, is fixed, and the coprime integers tend to infinity. Suppose that, for some ,
Then is syndetic. Its positive part has positive lower asymptotic density and divergent reciprocal sum.
Recurrence, perturbations, and rotations
For a fixed , infinitely many pairs in (1) are equivalent to pairs with both entries arbitrarily large. Indeed, each first entry determines at most one second entry. In particular, is symmetric, and when is infinite.
For the models (3), define
This set is symmetric as well.
Lemma 2.1 (Transfer under bounded perturbations). For every there is with . If is a gap bound for , then is a gap bound for .
Proof. Choose infinitely many modeled pairs . By (5), choose satisfying . Hence
Both entries tend to infinity along the chosen indices. The difference takes values in a fixed finite set of integers, so one value occurs infinitely often and belongs to . Given , choose . The corresponding lies in .
We use the circle norm .
Lemma 2.2 (Compact rotation lemma). Let and let . Then
is syndetic. If an irrational rotation of is given, its visits to any nonempty open arc are syndetic.
Proof. Let be the closure of and let . The set is a compact subgroup. Since the orbit is dense in and is symmetric, the sets , , cover . Choose a finite subcover indexed by . For every integer , some satisfies . Thus . If and , apply this identity to to obtain an element of in .
For the last assertion, the orbit closure of an irrational circle rotation is the whole circle. Translates of a nonempty open arc by the orbit therefore cover . The same finite-subcover argument applies.
We recall briefly the density assertion used here. An infinite subgroup of has nonzero elements arbitrarily close to zero, by compactness and taking differences. Multiples of an element with sufficiently small nonzero representative approximate every point of the circle. Its closure is consequently . The subgroup generated by an irrational element is infinite. The pigeonhole principle gives positive integers with . Positive iterates therefore approximate each negative iterate, so the forward orbit is dense as well. Deleting finitely many iterates preserves this density.
The integer congruence and its interval
Suppress the subscript . Let satisfy , and put
The target occurs in exactly when
Define
Lemma 3.1. The equation (12) has an admissible solution if and only if there is an integer such that
Moreover,
and
Proof. The congruence in (14) is equivalent to . It makes an integer. The conditions are precisely , giving (3.2) together with the bounds on $i$. Taking a minimum or maximum with a fixed real number preserves the Lipschitz bound of the other argument, which gives (3.4. Finally, in the coordinate $t=a+gpi$, the hulls $I$ and $J+r$ correspond respectively to $[0,L]$ and $[x/p,(x+qR)/p]$. This proves {xref}(3.5).
In particular, every integer in the common interior
that has the required residue class is admissible for the target .
Bounded contact
Proof of Theorem 1.1(1). There are only finitely many integer differences of absolute value at most . Pass to an infinite subsequence on which one fixed signed difference occurs in and the overlap bound holds. For this subsequence set
and use (13) with . Choose an anchor representing .
Translating one interval by changes its intersection length with a fixed interval by at most . Consequently
After discarding finitely many indices, there is a fixed such that
Pass to a further subsequence on which converges in to .
Fix with . Let be a least absolute residue of modulo . Then
eventually. For , the residue is nonzero. Otherwise the inverse congruence would give . Thus .
Put . For all sufficiently large , we have and, by (18)–(19),
If lies in the lower half of its interval, choose a sign so that . If it lies in the upper half, choose the sign so that . The near endpoint has margin at least , and (20) gives the far-end margin. Therefore
Its residue is modulo . Lemma 3.1 proves that .
For this fixed , one sign occurs infinitely often. Symmetry of then gives an satisfying
For , the anchor itself gives the same conclusion. By Lemma 2.2, the set of integers with is syndetic. Its dilation by is syndetic, and (21) implies that is syndetic. Lemma 2.1 completes the proof. □
The finite circular-gap criterion
The following elementary interpretation will be useful. If , then
is a positive integer. Every block of consecutive integers meets
Indeed, the largest gap between consecutive elements of this periodic integer set is . Translating the phase set preserves this property.
Lemma 5.1 (Two-window lemma). Use the notation of Section 3 and let be given by (22). Suppose . For an integer , assume
Then some satisfies .
Proof. Put and . Every integer with
lies in . The lower bound follows from the definition of . For the upper bound, use
The resulting common interval is contained in for every in the asserted -window, by (15).
Consider separately the two disjoint windows
For a window beginning at , apply the periodic-gap property at and then translate by . Thus, for each , there are and an integer with
If either satisfies (24), Lemma 3.1 gives the required target. If neither does, both equal . Multiplying their congruences by then gives . But the two chosen indices satisfy , a contradiction. □
Proof of Theorem 1.1[2]. Restrict to the infinite set of indices satisfying (8), and then to a subsequence with fixed. For each such model use . By (16), the finite test is exactly
For each fixed integer , condition (23) holds for all sufficiently large . Lemma 5.1 produces a difference with in the fixed -window. One of these finitely many differences occurs for infinitely many indices, and hence belongs to .
Given , take . Then , and every from this -window lies in . Thus is a gap bound for . Lemma 2.1 gives for . □
Centered finite families
Proof of Theorem 1.2. First consider one set and suppress . Pass to a subsequence on which the normalized inverse converges to . Fix with . Choose a least absolute residue of modulo . For all sufficiently large ,
The number is an integer, and
Thus and . The two modeled points with these indices have difference , and their entries escape to infinity. We have proved
Apply (25) separately to each , obtaining . Let and set . Lemma 2.2 shows that
is syndetic. For , formula (25) gives for every . The dilation is syndetic, proving the intersection assertion.
If is a gap bound for the intersection, each interval , , contains a positive element. These disjoint intervals give lower asymptotic density at least . Choosing one element from each also gives a reciprocal-sum lower bound
Separated models and zero-density examples
Separated-pair realizations are discussed in [6], and recurring-template conditions in [7].
Proposition 7.1. Suppose is an exact union, the block hulls are ordered with successive gaps tending to infinity, and (4) holds. Suppose also that for every sufficiently large , for some . Then
If these minimum distances do not tend to infinity, then is syndetic.
Proof. Fix a nonzero integer . Sufficiently late distinct blocks are separated by more than , and sufficiently late row steps exceed . Thus a pair with difference in the late blocks must use different rows of the same block. If their minimum mutual distance tends to infinity, these pairs are eventually impossible as well. The finitely many earlier points yield only finitely many pairs with difference . Since is infinite, .
Failure of convergence of the minimum distances to infinity gives a finite and infinitely many bounded contacts. Theorem 1.1(1), with , applies.
For the explicit examples, choose and place the rows by
The gap between consecutive block hulls is exactly . We use the upper Banach density
where ranges over the positive integers.
Lemma 7.2. Any union placed by (26), with both row steps tending to infinity, has zero upper Banach density. Every fixed three-element set has only finitely many translates contained in the union.
Proof. Fix a positive integer . Beyond finitely many blocks, every hull gap and both row steps exceed . An interval of diameter at most meets at most one of these blocks and contains at most one point from each of its rows. It therefore contains at most two late points. Let be the finite set of earlier points. Any interval of consecutive integers contains at most
points of . Dividing by , taking the supremum over interval positions and then the limit superior as gives . Since is arbitrary, . Taking larger than the diameter of a fixed three-element set excludes every translate sufficiently far out. Only finitely many earlier translates remain. □
Proposition 7.3 (An exact irrational example). For every irrational there is an exact separated union satisfying both conditions of Theorem 1.1, with and , such that
The set has zero upper Banach density. The set contains no infinite arithmetic progression of nonzero step, and has infinitely many pairwise almost disjoint translates.
Proof. Take an increasing sequence of primes large enough that lies in . Choose with , and put
using the least nonnegative residue for . Then , , and . Place the blocks by (26).
For any fixed , the normalized admissible interval tends to , and the fractional residue of an admissible tends to
because . For , irrationality ensures that this limit is neither endpoint. The interval eventually has length less than one and lies arbitrarily close to . Lemma 3.1 therefore gives
The reversed orientation gives the reflected arc. The separated-block argument excludes all other recurrent nonzero differences, proving (27).
The normalized overlap tends to . Density of the irrational orbit provides a fixed whose phase lies in the interior arc, giving bounded contact. It also gives an with . The largest circular gap of a finite point set is continuous under movement of its points: moving each point by at most changes that gap by at most , as follows by trimming from each end of an empty arc and reversing the roles of the sets. Hence (8) holds eventually. Lemma 7.2 proves zero upper Banach density.
On an arithmetic progression with , the phases are dense in . Infinitely many have circle norm less than and give nonzero integers outside (27). Thus no such infinite progression is contained in .
Finally choose infinitely many distinct positive integers with . For distinct choices , we have , so . An infinite intersection would give infinitely many pairs in with this difference. Every such intersection is therefore finite. □
Remark 7.4. Lemma 7.2 also separates these examples from the supra-SIM class. Goldbring–Leth [2 Corollary 4.7] show that every supra-SIM set contains with infinite and of any prescribed finite cardinality. Taking contradicts the lemma.
Boundary and order-of-magnitude examples
Proposition 8.1. For every rational in lowest terms, including , there is an exact separated union with normalized inverse tending to , normalized overlap tending to , and recurrent difference set .
Proof. Take increasing integers satisfying , and set
The congruence is automatic when . The parameters have , , and . Use the least nonnegative and the placement (26), with .
Since , the normalized overlap tends to . For a fixed , the fractional class in the admissibility test is
If is an integer, its representative is eventually near . Otherwise that representative is at least . In both cases it eventually exceeds , because . Every allowed lies in . Thus every fixed cross-row difference is eventually absent. The same holds after reversal, while same-row and cross-block differences are excluded as in Proposition 7.1. Hence .
The construction shows that equality at a limiting rational overlap does not supply the finite inequalities in (8). A zero limiting overlap likewise allows failure with an irrational limiting inverse. To see this, retain the steps and offsets in (28), and replace both normalized row lengths by a positive sequence tending to zero. Every fixed nonzero target has a limiting phase different from zero and is eventually absent.
Proposition 8.2. For each there is an exact separated union satisfying the finite test eventually and having . Thus the order of the gap bound in Theorem 1.1(2) is necessary.
Proof. For , take increasing with , let and , and set
Place the rows by (26) with the chosen . All within-block differences are multiples of . For a fixed target , its limiting fractional phase is and the normalized admissible interval tends to . Among the possible phases, exactly the one with is in , and none is an endpoint. The reflected orientation gives the same congruence class. Thus the separated-block argument gives .
The largest circular gap of the first multiples of tends to , so the finite test holds eventually. For , take , , , and . Each fixed multiple recurs by using equal indices in the two rows and, when necessary, reversing the orientation. Every within-block difference is a multiple of , so . The normalized overlap tends to , and the singleton gap is .
The smallest gap bound of is , which proves the assertion.
For a centered zero-density example in Theorem 1.2, take
where and . The centered block hull is . Equal centered indices give every fixed multiple of eventually, so . Lemma 7.2 gives zero upper Banach density.
The uncentered hypotheses alone do not ensure the finite-intersection conclusion. Use the irrational construction with common , normalized row length , and phases and in place of in (28). The respective recurrent nonzero phases lie in
These open sets are disjoint. The two recurrent difference sets are individually syndetic and have intersection .
Reciprocal divergence
Reciprocal divergence by itself does not force a nonzero recurrent difference. An elementary example, also recorded in the note of Plasma AI [8], is
For , we have . Consecutive gaps within this block equal , and the transition to the next block has a still larger gap. Thus the gaps tend to infinity and . On the other hand,
so the reciprocal sum diverges.
The rational construction of Proposition 8.1 can also be made reciprocally divergent. After its th row block, whose last point is , insert the progression
Start the next row block at . Each inserted progression contributes more than to the reciprocal sum, since
Every inserted step and every gap between the enlarged pieces tends to infinity. No new fixed nonzero difference recurs, and the argument of Lemma 7.2 still gives zero upper Banach density. The resulting set therefore has divergent reciprocal sum and recurrent difference set .
Acknowledgments
The authors acknowledge AI assistance from OpenAI’s ChatGPT in developing and reviewing the arguments and preparing the mathematical exposition.
References
- [1]P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial Number Theory, Monographies de L’Enseignement Mathématique, no. 28, Université de Genève, Geneva, 1980.
- [2]J. Goldbring and S. Leth, On supra-SIM sets of natural numbers, arXiv:1805.05933, 2018.arxiv.org/abs/1805.05933
- [3]S. Leth, Some nonstandard methods in combinatorial number theory, Studia Logica 47 (1988), no. 3, 265–278. doi:10.1007/BF00370556.DOI
- [4]I. Z. Ruzsa, On difference sets, Studia Scientiarum Mathematicarum Hungarica 13 (1978), 319–326.
- [5]C. L. Stewart and R. T. Tidemann, On infinite-difference sets, Canadian Journal of Mathematics 31 (1979), no. 5, 897–910. doi:10.4153/CJM-1979-085-6.DOI
- [6]Erdős Problem a Day, Erdős problem #332: live audit and a sharp upper-Banach-density boundary, working report, 28 July 2026. Sections 3–4. erdosproblemday.com/report/332.
- [7]jeremy-math-332-worker, Fixed-template discussion for Erdős #332, Botnet, 29 September 2026. botnet.com, Erdős #332 discussion.
- [8]Plasma AI, Recurrent difference sets, research note, accessed 11 November 2026. erdosproblems.ai, Recurrent difference sets.