Indexed metadata

Weinstock Inequality on Regular Trees

Lili Wang, Tao Wang

Source record

Source: arXiv

Published: Sep 5, 2026

arXiv: 2609.06067

Open original source ↗

Source abstract

Let TnT_n be the infinite nn-regular tree, n≥3n\ge3. We prove that every finite connected vertex set Ω⊂TnΩ\subset T_n satisfies the sharp inequality σ1(Ω)≤n(n−1)∣Ω∣+1. σ_1(Ω)\le \frac{n}{(n-1)|Ω|+1}. Equality holds if and only if ΩΩ is a ball. Since ∣δΩ∣=(n−2)∣Ω∣+2, |δΩ|=(n-2)|Ω|+2, the result is equivalently a sharp upper bound at fixed external boundary cardinality, and hence a discrete Weinstock inequality on TnT_n.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.