Metraipolis › archive › dc_4b3167a24aba

Sharp Order Laws and Finite-Defect Stability for Domination versus Small Laplacian Eigenvalues in Trees — arXiv:2608.27602

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27602
License (as archived)
CC0-1.0
Archived
2026-10-17T11:22:57.126Z
SHA-256 of the archived text
243323edd219de842455c32685ae05e18d406a771273633d3d5f140c24d3e6ef
Stable URL of this page
https://metraipolis.com/documento/dc_4b3167a24aba

How to cite

Sharp Order Laws and Finite-Defect Stability for Domination versus Small Laplacian Eigenvalues in Trees — arXiv:2608.27602 — arXiv (en), https://arxiv.org/abs/2608.27602 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4b3167a24aba (Metraipolis archive dc_4b3167a24aba, sha256 243323edd219de842455c32685ae05e18d406a771273633d3d5f140c24d3e6ef)
BibTeX
@misc{dc4b3167a24aba,
  title = {Sharp Order Laws and Finite-Defect Stability for Domination versus Small Laplacian Eigenvalues in Trees — arXiv:2608.27602},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27602},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4b3167a24aba; sha256 243323edd219de842455c32685ae05e18d406a771273633d3d5f140c24d3e6ef},
  year = {2026}
}

Archived text

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

For a tree T, let gamma(T) be its domination number and let mu(T) count the Laplacian eigenvalues in [0,1). The strict inequality gamma(T)/mu(T)<4/3 leaves open three linked questions: the exact finite-order defect, the structure near equality, and whether a fixed defect permits only finitely many local obstructions. We answer all three. For every n>=2, max_{|V(T)|=n} (7 gamma(T)-9 mu(T)) = floor((n-20)/9). Thus order twenty-nine is the first at which the ratio 9/7 can be exceeded. The proof is based on an exact decomposition of Phi(T)=|V(T)|-20-9(7 gamma(T)-9 mu(T)) into nonnegative integer terms, together with a clean-contraction identity. For subcubic trees, equality cases are canonical lifts of trees with perfect matchings. We classify every layer through Phi=42, locating successive phase transitions at 20, 21, 40, 41, and 42. The finiteness mechanism is simple to state: after the repeatable matched-skeleton pieces are removed, fixed slack leaves only a bounded exceptional core. Formally, a local compactness theorem bounds every nonordinary weighted deep component at fixed packing surplus and residual negative index. Consequently, for each fixed k, every subcubic tree with Phi(T)=k consists of a bounded ported defect kernel, an arbitrary compatible forest of ordinary tiles, and at most floor(k/21) clean expansions. All unbounded statements are proved symbolically; exact computation is used only for explicitly bounded atom lists and independent finite verification.

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