Metraipolis › archive › dc_47ff511b0c70

Avoiding four-term progressions from finitely many starts — arXiv:2609.13350

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.13350
License (as archived)
CC0-1.0
Archived
2026-10-16T01:23:00.092Z
SHA-256 of the archived text
030b456812dc0d74e0a60b26fcf27d0d6e70cf2fca83638bed6c131919b8f08e
Stable URL of this page
https://metraipolis.com/documento/dc_47ff511b0c70

How to cite

Avoiding four-term progressions from finitely many starts — arXiv:2609.13350 — arXiv (en), https://arxiv.org/abs/2609.13350 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_47ff511b0c70 (Metraipolis archive dc_47ff511b0c70, sha256 030b456812dc0d74e0a60b26fcf27d0d6e70cf2fca83638bed6c131919b8f08e)
BibTeX
@misc{dc47ff511b0c70,
  title = {Avoiding four-term progressions from finitely many starts — arXiv:2609.13350},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13350},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_47ff511b0c70; sha256 030b456812dc0d74e0a60b26fcf27d0d6e70cf2fca83638bed6c131919b8f08e},
  year = {2026}
}

Archived text

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

For every finite set $A\subset\mathbb{Z}$, we construct a bijection $p:\mathbb{N}_0\to\mathbb{Z}$ beginning with $0,1$ that contains no four-term arithmetic progression, in occurrence order, whose first value belongs to $A$. More generally, for each $n\ge2$ the enumeration can begin with $0,1,3,\ldots,2^{n-1}-1$ and simultaneously avoid every such progression starting in $A$ or among these first $n$ entries. The construction uses finitely branching prerequisite relations and an explicit bounded integer potential. This proves finite prerequisite closure and gives an exhaustive enumeration, rather than merely a total order. We also give an extension theorem for finite prefixes with compatible binary-tail constraints. These results do not determine whether every enumeration of the integers contains an ordered four-term arithmetic progression.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.13350 — 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-16T00:39:30.165Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).