Metraipolis › archive › dc_f906dae970a6

Refined upper bounds on Schur-like numbers — arXiv:2608.03661

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.03661
License (as archived)
CC0-1.0
Archived
2026-10-31T12:55:52.387Z
SHA-256 of the archived text
5cf26eab632b277ac949805eb05201fc52f7d9354da301f3c9c6cabf10b28d48
Stable URL of this page
https://metraipolis.com/documento/dc_f906dae970a6

How to cite

Refined upper bounds on Schur-like numbers — arXiv:2608.03661 — arXiv (en), https://arxiv.org/abs/2608.03661 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f906dae970a6 (Metraipolis archive dc_f906dae970a6, sha256 5cf26eab632b277ac949805eb05201fc52f7d9354da301f3c9c6cabf10b28d48)
BibTeX
@misc{dcf906dae970a6,
  title = {Refined upper bounds on Schur-like numbers — arXiv:2608.03661},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.03661},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f906dae970a6; sha256 5cf26eab632b277ac949805eb05201fc52f7d9354da301f3c9c6cabf10b28d48},
  year = {2026}
}

Archived text

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

For positive integers $r, m$ and $N$, every $r$-coloring of $\{1, \dots, N\}$ contains a monochromatic solution to $x_1+\dots+x_{m+1}=y_1+\dots+y_m$ provided that $N \ge 3^r (r!)^{1/m}$, which is qualitatively optimal when $m$ is logarithmic in $r$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-05 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2608.03661 — 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-31T12:42:47.782Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).