EUVIMEDEUVIMED entdecken
Crossref

Supersimplicity and arithmetic progressions

Amador Martin‐Pizarro, Daniel Palacín

Journal of the London Mathematical Society · 2026-04 · 113 (4)

DOI: 10.1112/jlms.70531 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of the London Mathematical Society, online erschienen am 01.04.2026. Verfasst von Amador Martin‐Pizarro und 1 weiteren Autor:innen. Die Arbeit nennt 42 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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árközy's theorem on the distance of distinct elements being perfect squares.

Zitieren

APA

Martin‐Pizarro, A., & Palacín, D. (2026). Supersimplicity and arithmetic progressions. Journal of the London Mathematical Society, 113(4). https://doi.org/10.1112/jlms.70531

Vancouver

Martin‐Pizarro A, Palacín D. Supersimplicity and arithmetic progressions. Journal of the London Mathematical Society. 2026;113(4). doi:10.1112/jlms.70531

BibTeX
@article{MartinPizarro2026,
  author = {Martin‐Pizarro, Amador and Palacín, Daniel},
  title = {Supersimplicity and arithmetic progressions},
  journal = {Journal of the London Mathematical Society},
  year = {2026},
  volume = {113},
  number = {4},
  doi = {10.1112/jlms.70531}
}
Kostenlos starten →