Stability and sparsity in sets of natural numbers
Gabriel Conant

TL;DR
This paper explores how the sparsity of subsets of natural numbers influences the stability of their associated structures in model theory, establishing conditions under which stability and sparsity are interconnected.
Contribution
It demonstrates that strong sparsity assumptions on sets A imply the stability of the structure (Z,+,0,A), and connects model-theoretic stability with combinatorial density properties of sumsets.
Findings
Strong sparsity leads to stability of (Z,+,0,A)
Sets like Fibonacci numbers and diverging ratio sets are stable
Stability implies zero upper Banach density of sumsets
Abstract
Given a set , we consider the relationship between stability of the structure and sparsity of the set . We first show that a strong enough sparsity assumption on yields stability of . Such sets include examples considered by Palac\'{i}n and Sklinos and Poizat, many classical linear recurrence sequences (e.g. the Fibonaccci numbers), and any set in which the limit of ratios of consecutive elements diverges. Finally, we consider sparsity conclusions on sets , which follow from model theoretic assumptions on . We use a result of Erd\H{o}s, Nathanson, and S\'{a}rk\"{o}zy to show that if does not define the ordering on , then the lower asymptotic density of any finitary sumset of is zero. Finally, in a theorem communicated to us by Goldbring, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
