.png){kind=icon}
.png){kind=icon}
Return
Supersimplicity and arithmetic progressions
.png){kind=icon}
PRE
AI
DOI：10.1112/jlms.70531.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corput's theorem on arithmetic progressions of length 3) with well-known tools and theorems for definable groups in simple theories. In the last sections of this article, we apply our model-theoretic results to bound the number of initial points starting few arithmetic progressions of length 3 in the structure of the additive group of integers with a predicate for the prime integers, assuming Dickson's conjecture, or with a predicate for the square-free integers, as well as for asymptotic limits of finite fields. Our techniques yield similar results for the elements appearing as distances in skew-corners and for S & aacute;rk & ouml;zy's theorem on the distance of distinct elements being perfect squares.
Keywords:
FIELDS
SETS
STABILITY
INTEGERS
THEOREM
Journal
J
IF:
0
Papers:
178
Citations:
0