Metraipolis › archive › dc_a27ab64802c4

Brown-Gerver-Ramsey Theorems in Small Dimensions — arXiv:2609.20366

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.20366
License (as archived)
CC0-1.0
Archived
2026-10-10T04:47:22.206Z
SHA-256 of the archived text
f94faa5bc732030946600848d0fe4a00707786818a13ec5efc6db8264068cd98
Stable URL of this page
https://metraipolis.com/documento/dc_a27ab64802c4

How to cite

Brown-Gerver-Ramsey Theorems in Small Dimensions — arXiv:2609.20366 — arXiv (en), https://arxiv.org/abs/2609.20366 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a27ab64802c4 (Metraipolis archive dc_a27ab64802c4, sha256 f94faa5bc732030946600848d0fe4a00707786818a13ec5efc6db8264068cd98)
BibTeX
@misc{dca27ab64802c4,
  title = {Brown-Gerver-Ramsey Theorems in Small Dimensions — arXiv:2609.20366},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20366},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a27ab64802c4; sha256 f94faa5bc732030946600848d0fe4a00707786818a13ec5efc6db8264068cd98},
  year = {2026}
}

Archived text

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

We consider infinite walks in $\mathbb{N}^k$ with standard unit basis vector steps that avoid $t$ collinear points, and show that these walks exist for $(k,t) \in \{(6,3), (4,4), (3,7)\}$. In particular, our construction for $k = 3$ improves the previous bound $189$, obtained by Lidbetter, to $7$. Our results also imply the existence of infinite words over small finite alphabets that are weakly abelian squarefree (resp., weakly abelian cubefree, weakly abelian 6th-power-free).

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2609.20366 — 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-10T04:15:33.150Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).