Metraipolis › archive › dc_c06be9dcab69

Finite and infinite barrycades — arXiv:2609.18476

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.18476
License (as archived)
CC0-1.0
Archived
2026-10-15T16:13:07.088Z
SHA-256 of the archived text
8cc64561529db41b443e0e5a4fb335f2671ebafa0ec6b4167d150fca654a5ac5
Stable URL of this page
https://metraipolis.com/documento/dc_c06be9dcab69

How to cite

Finite and infinite barrycades — arXiv:2609.18476 — arXiv (en), https://arxiv.org/abs/2609.18476 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c06be9dcab69 (Metraipolis archive dc_c06be9dcab69, sha256 8cc64561529db41b443e0e5a4fb335f2671ebafa0ec6b4167d150fca654a5ac5)
BibTeX
@misc{dcc06be9dcab69,
  title = {Finite and infinite barrycades — arXiv:2609.18476},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.18476},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c06be9dcab69; sha256 8cc64561529db41b443e0e5a4fb335f2671ebafa0ec6b4167d150fca654a5ac5},
  year = {2026}
}

Archived text

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

An $n$-barrycade of height $h$ is a set of $h$ permutations of $[n]$ such that all the prefix sums are different. This notion was described in 2020 by Richard Guy, together with the central problem to determine for which values of $n$ there exists a break-free $n$-barrycade, that is, one in which every possible prefix sum from $1$ to $\frac{n(n+1)}{2}-1$ is covered. The height of such barrycade would be $\frac{n+2}{2}$. We prove that barrycades of linear height exist for infinitely many sizes: there is a constant $c>0$ such that for infinitely many positive integers $n$ there exists an $n$-barrycade of height at least $cn$. We also explore an infinite variant of the problem and propose three constructions -- greedy, grasshopper and precise grasshopper -- that give increasingly more satisfying results. Along the way we encounter new integer sequences and formulate conjectures concerning omitted elements, missing partial sums, and word representations of infinite barrycades, which are firmly supported by computational data.

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