Metraipolis › archive › dc_44e73056dff0

Arithmetic Progressions in Midpoint Colourings — arXiv:2610.11847

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.11847
License (as archived)
CC0-1.0
Archived
2026-10-09T06:29:08.452Z
SHA-256 of the archived text
0f6b23c9894dea12f2504d9954e2ae1ee3870300139bed571362d6f79eebe93e
Stable URL of this page
https://metraipolis.com/documento/dc_44e73056dff0

How to cite

Arithmetic Progressions in Midpoint Colourings — arXiv:2610.11847 — arXiv (en), https://arxiv.org/abs/2610.11847 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_44e73056dff0 (Metraipolis archive dc_44e73056dff0, sha256 0f6b23c9894dea12f2504d9954e2ae1ee3870300139bed571362d6f79eebe93e)
BibTeX
@misc{dc44e73056dff0,
  title = {Arithmetic Progressions in Midpoint Colourings — arXiv:2610.11847},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.11847},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_44e73056dff0; sha256 0f6b23c9894dea12f2504d9954e2ae1ee3870300139bed571362d6f79eebe93e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11847. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We introduce an asymmetric variant of a classic problem by Roth about colourings of integers and midpoints. The new problem cannot be solved with the standard approach by Erdös-Sárközy-Sós which uses symmetry. We describe a Fourier Analytic approach which gives asymptotically tight bounds. In the $\mathbb{F}_3^n$ setting, the density increment we show is efficient and together with the Freiman-Ruzsa Theorem provides an affine subspace of near optimal codimension within the distinguished set. This approach adopted to the setting of the integers from $1$ to $N$ via Bohr sets and Bogolyubov-Ruzsa Lemma gives a progression of length being a power of $N$ which only depends on the number of colours. We then use Chang's Lemma and Balog-Szemerédi-Gowers Theorem to further improve the dependence on the number of colours.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2610.11847 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:53:57.214Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).