Metraipolis › archive › dc_49aa8f048a07
Pebbling Numbers and Generator Reinforcement of Cayley Graphs — arXiv:2610.41306
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41306
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T05:44:31.024Z
- SHA-256 of the archived text
9dd8b97e7e77e84170382e27c4f30efe12b073a49114ba4d6b965360506dc558- Stable URL of this page
https://metraipolis.com/documento/dc_49aa8f048a07
How to cite
Pebbling Numbers and Generator Reinforcement of Cayley Graphs — arXiv:2610.41306 — arXiv (en), https://arxiv.org/abs/2610.41306 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_49aa8f048a07 (Metraipolis archive dc_49aa8f048a07, sha256 9dd8b97e7e77e84170382e27c4f30efe12b073a49114ba4d6b965360506dc558)
BibTeX
@misc{dc49aa8f048a07,
title = {Pebbling Numbers and Generator Reinforcement of Cayley Graphs — arXiv:2610.41306},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41306},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_49aa8f048a07; sha256 9dd8b97e7e77e84170382e27c4f30efe12b073a49114ba4d6b965360506dc558},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41306. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study inverse-closed generator additions of minimum size that make the optimal pebbling number of a finite Cayley graph at most three while preserving its specified regular action. A weighted vertex-cover formulation on inverse orbits yields an $O(|\Gamma|^2)$ algorithm for abelian groups in the explicit multiplication-table model. We derive formulas for central involutions and cubelike graphs, with an inverse-closure correction determined by square roots in the uncovered set. The exact thresholds are $2^{d-1}-d$ for hypercubes ($d\ge1$), and $3$ for standard Keller graphs when $d=2$ and $2^{d-1}$ when $d\ge3$. Every admissible augmentation of either family has ordinary pebbling number equal to its order.
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/2610.41306 — 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-03T05:32:16.990Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).