Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Notation (p. 1). For finite subsets A,SA,S of an abelian group GG, ∂S(A)=∣{(a,s)∈A×S:a+s∉A}∣\partial_S(A)=|\{(a,s)\in A\times S:a+s\notin A\}|, the number of edges from AA to G∖AG\setminus A in the directed Cayley graph of GG induced by SS. A homocyclic group of exponent mm is CmnC_m^n with n≥1n\ge1 (p. 2).

Theorem 1 (p. 2). Let GG be homocyclic with exp⁡(G)∈{2,3,4}\exp(G)\in\{2,3,4\} and rank n=rk⁡Gn=\operatorname{rk}G. If A⊆GA\subseteq G is non-empty and ∂S(A)≤(1−γ)n∣A∣\partial_S(A)\le(1-\gamma)n|A| for some generating subset S⊆GS\subseteq G and some real γ∈(0,1]\gamma\in(0,1], then

∣A∣≥∣G∣γ.|A|\ge|G|^{\gamma}.

The hypothesis is measured against the rank nn, not against ∣S∣|S|.

Examples 1-3 (p. 2) delimit the theorem. All three work in CmnC_m^n; Examples 1 and 3 use a standard generating set {e1,…,en}\{e_1,\ldots,e_n\}.

  • Example 1 (m≥2m\ge2, integers k,n≥1k,n\ge1 with k=log⁡mn+O(1)k=\log_m n+O(1), absolute implicit constant): A=⟨e1,…,ek⟩A=\langle e_1,\ldots,e_k\rangle and S=A∪{ek+1,…,en}S=A\cup\{e_{k+1},\ldots,e_n\} give ∂S(A)=(n−k)∣A∣=(1−γ)∣S∣∣A∣\partial_S(A)=(n-k)|A|=(1-\gamma)|S||A| with γ=mk/(mk+n−k)\gamma=m^k/(m^k+n-k), while ∣A∣=mk|A|=m^k is much smaller than ∣Cmn∣γ=mγn|C_m^n|^\gamma=m^{\gamma n}. So the hypothesis cannot be relaxed to ∂S(A)≤(1−γ)∣S∣∣A∣\partial_S(A)\le(1-\gamma)|S||A|.
  • Example 2 (m≥2m\ge2, integers k,n≥1k,n\ge1, k∣nk\mid n): with Cmn=H1⊕⋯⊕HkC_m^n=H_1\oplus\cdots\oplus H_k, each Hi≅Cmn/kH_i\cong C_m^{n/k}, an nn-element generating set SS with n/kn/k elements in each HiH_i, and A=H1∪⋯∪HkA=H_1\cup\cdots\cup H_k, one has ∣A∣=(mn/k−1)k+1|A|=(m^{n/k}-1)k+1 and ∂S(A)=(mn/k−1)(k−1)n\partial_S(A)=(m^{n/k}-1)(k-1)n. For γ=k−1\gamma=k^{-1} this gives ∂S(A)<(1−γ)n∣A∣\partial_S(A)<(1-\gamma)n|A| and ∣A∣≤mn/kk=γ−1∣Cmn∣γ|A|\le m^{n/k}k=\gamma^{-1}|C_m^n|^\gamma, so the conclusion is nearly best possible.
  • Example 3 (integers 1<t<m1<t<m and n≥1n\ge1): the box A=[0,t−1]n⊆CmnA=[0,t-1]^n\subseteq C_m^n has ∣A∣=tn|A|=t^n and ∂S(A)=ntn−1\partial_S(A)=nt^{n-1}. With γ=1−t−1\gamma=1-t^{-1} one has ∂S(A)=(1−γ)n∣A∣\partial_S(A)=(1-\gamma)n|A| and ∣A∣=bγn|A|=b^{\gamma n}, where b=tγ−1=exp⁡(tlog⁡t/(t−1))b=t^{\gamma^{-1}}=\exp(t\log t/(t-1)), which is 44 at t=2t=2. So the theorem does not extend directly to exp⁡(G)>4\exp(G)>4; there the paper says the best one can hope for in general is ∣A∣≥4γn|A|\ge4^{\gamma n} with n=rk⁡Gn=\operatorname{rk}G.

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 GG of exponent m∈{2,3,4}m\in\{2,3,4\}, any generating subset S⊆GS\subseteq G and any non-empty A⊆GA\subseteq G, ∂S(A)≥∣A∣log⁡m(∣G∣/∣A∣)\partial_S(A)\ge|A|\log_m(|G|/|A|). With the hypothesis this gives log⁡m(∣G∣/∣A∣)≤(1−γ)n\log_m(|G|/|A|)\le(1-\gamma)n, and ∣G∣=mn|G|=m^n finishes the argument.

Dependencies

[L15, Corollary 1.10], external. The theorem is used in the proof of Corollary 1.