Stability and sparsity in sets of natural numbers
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 use a result of Jin to show that if is stable, then the upper Banach density of any finitary sumset of is zero.
Keywords
Cite
@article{arxiv.1701.01387,
title = {Stability and sparsity in sets of natural numbers},
author = {Gabriel Conant},
journal= {arXiv preprint arXiv:1701.01387},
year = {2020}
}
Comments
27 pages; final version incorporating referee comments