Metraipolis › archive › dc_283bfa921cf4

How to Construct High Barrycades — arXiv:2609.24373

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.24373
License (as archived)
CC0-1.0
Archived
2026-10-09T21:49:45.892Z
SHA-256 of the archived text
b2f290201c1dd4ce75bd4f27db071eb95869758be8bab804d5364b56814ad18e
Stable URL of this page
https://metraipolis.com/documento/dc_283bfa921cf4

How to cite

How to Construct High Barrycades — arXiv:2609.24373 — arXiv (en), https://arxiv.org/abs/2609.24373 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_283bfa921cf4 (Metraipolis archive dc_283bfa921cf4, sha256 b2f290201c1dd4ce75bd4f27db071eb95869758be8bab804d5364b56814ad18e)
BibTeX
@misc{dc283bfa921cf4,
  title = {How to Construct High Barrycades — arXiv:2609.24373},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.24373},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_283bfa921cf4; sha256 b2f290201c1dd4ce75bd4f27db071eb95869758be8bab804d5364b56814ad18e},
  year = {2026}
}

Archived text

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

Given two positive integers height $h$ and order $n$, the barrycade construction problem asks for a set of $h$ permutations of the integers from $1$ to $n$ such that all the proper partial sums given by these permutations are pairwise distinct. The name barrycade was coined by Richard K. Guy and refers to Barry Cipra, who introduced this kind of arrangement problem. A simple calculation shows that a solution can only exist for $n \ge 2h-2$ and it is conjectured that there always exists a solution for every height $h \ge 2$ and order $n \ge 2h-2$. In this work, for every height $h \ge 1$, we present a construction of a barrycade of height $h$ and order $n = 2h+3$. We also present a randomized heuristic that allows us to find a barrycade of height $h$ and conjectured optimal order $n=2h-2$, for every height $2 \leq h \leq 50$. Thus, we confirm the conjectured optimal order for all heights up to $50$. We also consider a related corral construction problem, where the permutations define a cyclic arrangement. In this setting, for every height $h \ge 1$, we present a construction of a corral of height $h$ and order $n=2h$. A heuristic approach, similar to the one used for barrycades, allows us to find a corral of height $h$ and conjectured optimal order $n=2h-1$, for every height $1 \leq h \leq 50$. We confirm Tomoki Nakamigawa's conjecture on well-dispersed partitions of cyclic groups for the number of parts up to $20$.

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