Metraipolis › archive › dc_10dc1ea23883
A uniform double-factorial construction for consecutive-pattern packings — arXiv:2611.06937
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06937
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:52:35.774Z
- SHA-256 of the archived text
2c6a288dd5e6b5e3a8fa601f23ebebe9a726d0e4576953c0e2f83ece661521b7- Stable URL of this page
https://metraipolis.com/documento/dc_10dc1ea23883
How to cite
A uniform double-factorial construction for consecutive-pattern packings — arXiv:2611.06937 — arXiv (en), https://arxiv.org/abs/2611.06937 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_10dc1ea23883 (Metraipolis archive dc_10dc1ea23883, sha256 2c6a288dd5e6b5e3a8fa601f23ebebe9a726d0e4576953c0e2f83ece661521b7)
BibTeX
@misc{dc10dc1ea23883,
title = {A uniform double-factorial construction for consecutive-pattern packings — arXiv:2611.06937},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06937},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_10dc1ea23883; sha256 2c6a288dd5e6b5e3a8fa601f23ebebe9a726d0e4576953c0e2f83ece661521b7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06937. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For every overlap $m\geq 3$ and every pattern length $K\geq 2m+1$, we construct an explicit permutation $p\in\mathfrak{S}_K$ such that the number of permutations containing $j$ prescribed occurrences of $p$, with successive starts separated by $K-m$, is $(2j-1)!!$ for every $j\geq 1$. Additional occurrences are permitted. We prove that the corresponding occurrence poset is the ordinal sum of a chain on $m+j(K-m-2)$ elements and a comb on $2j$ elements. An insertion bijection counts the linear extensions of the comb. This gives the uniform representatives requested in the double-factorial part of Question 6 in Section 7 of Blitvić, Kammoun and Steingrímsson, arXiv:2610.29846v1 . A Lean 4 formalization and its recorded verification data accompany the paper.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.06937 — 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-11-06T14:24:27.834Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).