Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 1142

Preprint Number 1142

Previous Next Preprint server

1142. Gabriel Conant
Stability and sparsity in sets of natural numbers

Submission date: 5 January 2017


Given a set A ⊆ N, we consider the relationship between stability of the structure (Z,+,0,A) and sparsity assumptions on the set A. We first show that a strong enough sparsity assumption on A yields stability of (Z,+,0,A). Specifically, if there is a function f:A → R^+ such that sup_{a\in A}|a-f(a)|<∞ and {s/t : s,t in f(A), ¬ (t ≤ s)} is closed and discrete, then (Z,+,0,A) is superstable (of U-rank ω if A is infinite).
Such sets encompass many classical examples of linear recurrence sequences (e.g. the Fibonaccci numbers) as well as sets for which the limit of ratios of consecutive elements diverges. In particular, this includes examples previously considered in work of Palacín-Sklinos and Poizat. Finally, we show that stability of (Z,+,0,A) implies a fair amount of sparsity for A. We use a result of Erdös, Nathanson, and Sárközy to show that if (Z,+,0,A) does not define the ordering on Z, then the lower asymptotic density of any finitary sumset of A is zero. We then show that stability of (Z,+,0,A) implies certain restrictions on the behavior of finite arithmetic progressions in finitary sumsets of A.

Mathematics Subject Classification:

Keywords and phrases:

Full text arXiv 1701.01387: pdf, ps.

Last updated: January 20 2017 12:11 Please send your corrections to: