Statement
Notation (p. 1). For finite subsets A,S of an abelian group G,
∂S(A)=∣{(a,s)∈A×S:a+s∈/A}∣, the number of edges
from A to G∖A in the directed Cayley graph of G induced by S.
A homocyclic group of exponent m is Cmn with n≥1 (p. 2).
Theorem 1 (p. 2). Let G be homocyclic with exp(G)∈{2,3,4} and
rank n=rkG. If A⊆G is non-empty and
∂S(A)≤(1−γ)n∣A∣ for some generating subset S⊆G
and some real γ∈(0,1], then
∣A∣≥∣G∣γ.
The hypothesis is measured against the rank n, not against ∣S∣.
Examples 1-3 (p. 2) delimit the theorem. All three work in Cmn;
Examples 1 and 3 use a standard generating set {e1,…,en}.
- Example 1 (m≥2, integers k,n≥1 with k=logmn+O(1), absolute
implicit constant): A=⟨e1,…,ek⟩ and
S=A∪{ek+1,…,en} give ∂S(A)=(n−k)∣A∣=(1−γ)∣S∣∣A∣
with γ=mk/(mk+n−k), while ∣A∣=mk is much smaller than
∣Cmn∣γ=mγn. So the hypothesis cannot be relaxed to
∂S(A)≤(1−γ)∣S∣∣A∣.
- Example 2 (m≥2, integers k,n≥1, k∣n): with
Cmn=H1⊕⋯⊕Hk, each Hi≅Cmn/k, an n-element
generating set S with n/k elements in each Hi, and
A=H1∪⋯∪Hk, one has ∣A∣=(mn/k−1)k+1 and
∂S(A)=(mn/k−1)(k−1)n. For γ=k−1 this gives
∂S(A)<(1−γ)n∣A∣ and ∣A∣≤mn/kk=γ−1∣Cmn∣γ,
so the conclusion is nearly best possible.
- Example 3 (integers 1<t<m and n≥1): the box A=[0,t−1]n⊆Cmn
has ∣A∣=tn and ∂S(A)=ntn−1. With γ=1−t−1 one has
∂S(A)=(1−γ)n∣A∣ and ∣A∣=bγn, where
b=tγ−1=exp(tlogt/(t−1)), which is 4 at t=2. So the
theorem does not extend directly to exp(G)>4; there the paper says the
best one can hope for in general is ∣A∣≥4γn with
n=rkG.
Source. Vsevolod F. Lev, On Isoperimetric Stability, Discrete Analysis
2018:14, 11 pp., doi:10.19086/da.3699: Theorem 1 and Examples 1-3 on p. 2, the
deduction on p. 6. The edition read is identified on the
source card.
Read depth. Claims checked: the statement and Examples 1-3 were read
clause by clause on the printed pages. The deduction (p. 6) was read; the
result of another paper that it rests on was not checked here.
Proof pointer
Page 6. The paper deduces the theorem from [L15, Corollary 1.10] (V. Lev,
Edge-isoperimetric problem for Cayley graphs and generalized Takagi function,
SIAM J. Discrete Math. 29 (2015), 2389-2411): for a finite abelian group G
of exponent m∈{2,3,4}, any generating subset S⊆G and any
non-empty A⊆G, ∂S(A)≥∣A∣logm(∣G∣/∣A∣). With the
hypothesis this gives logm(∣G∣/∣A∣)≤(1−γ)n, and ∣G∣=mn finishes
the argument.
Dependencies
[L15, Corollary 1.10], external. The theorem is used in the proof of
Corollary 1.