Metraipolis › archive › dc_35802c65c4f4
A Fixed-Offset Transition for Random Stackability on Paths — arXiv:2609.39633
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39633
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T14:15:17.752Z
- SHA-256 of the archived text
9993d3e67e6177f15a45a2e70909b896a98198c6e71cc08bef357b0ae5073f71- Stable URL of this page
https://metraipolis.com/documento/dc_35802c65c4f4
How to cite
A Fixed-Offset Transition for Random Stackability on Paths — arXiv:2609.39633 — arXiv (en), https://arxiv.org/abs/2609.39633 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_35802c65c4f4 (Metraipolis archive dc_35802c65c4f4, sha256 9993d3e67e6177f15a45a2e70909b896a98198c6e71cc08bef357b0ae5073f71)
BibTeX
@misc{dc35802c65c4f4,
title = {A Fixed-Offset Transition for Random Stackability on Paths — arXiv:2609.39633},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39633},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_35802c65c4f4; sha256 9993d3e67e6177f15a45a2e70909b896a98198c6e71cc08bef357b0ae5073f71},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39633. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study a support-collapse version of graph pebbling on paths. A configuration is stackable if a sequence of legal pebbling moves can produce a nonzero configuration supported on a single vertex. On the path P_n, we choose a configuration uniformly from all weak compositions of total n times mu_n, where mu_n is a positive integer. We prove a two-sided fixed-offset transition for the logarithmic density. The transition is centred at sqrt(log_2 n) - (1/2) log_2 log_2 n + log_2(3e). For every fixed epsilon greater than zero, the stackability probability tends to zero when log_2 mu_n is eventually at most the centre minus epsilon, and tends to one when it is eventually at least the centre plus epsilon. No assertion is made at zero offset. The proof uses an exact recursive stackability score on trees, a one-dimensional path-message recurrence, binary-partition asymptotics for rare dyadic deficit excursions, a constant-cost regeneration argument, and an exact deep-message necessity theorem. Conditioning independent geometric occupancies on their sum returns the uniform fixed-total model. The finite deterministic necessity theorem and its exact fixed-total corollary are formalised in Lean and registered with Palomar; the full probabilistic asymptotic theorem is not part of that registration. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.PR). Categorie arXiv: Combinatorics (math.CO) ; Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2609.39633 — 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-07T14:04:17.249Z dalla pagina https://arxiv.org/catchup/math.PR/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).