Metraipolis › archive › dc_7d348b88da65
Weinstock Inequality on Regular Trees — arXiv:2609.06067
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06067
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:49:14.363Z
- SHA-256 of the archived text
da95063b572f41fcdfca965c44f688cfd24efb465f2c0300e2502b8c424ba58e- Stable URL of this page
https://metraipolis.com/documento/dc_7d348b88da65
How to cite
Weinstock Inequality on Regular Trees — arXiv:2609.06067 — arXiv (en), https://arxiv.org/abs/2609.06067 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7d348b88da65 (Metraipolis archive dc_7d348b88da65, sha256 da95063b572f41fcdfca965c44f688cfd24efb465f2c0300e2502b8c424ba58e)
BibTeX
@misc{dc7d348b88da65,
title = {Weinstock Inequality on Regular Trees — arXiv:2609.06067},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06067},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7d348b88da65; sha256 da95063b572f41fcdfca965c44f688cfd24efb465f2c0300e2502b8c424ba58e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06067. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $T_n$ be the infinite $n$-regular tree, $n\ge3$. We prove that every finite connected vertex set $\Omega\subset T_n$ satisfies the sharp inequality \[ \sigma_1(\Omega)\le \frac{n}{(n-1)|\Omega|+1}. \] Equality holds if and only if $\Omega$ is a ball. Since \[ |\delta\Omega|=(n-2)|\Omega|+2, \] the result is equivalently a sharp upper bound at fixed external boundary cardinality, and hence a discrete Weinstock inequality on $T_n$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Spectral Theory (math.SP) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.06067 — 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-16T14:32:29.908Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).