English

Approximate convexity and an edge-isoperimetric estimate

Functional Analysis 2013-11-26 v1 Combinatorics

Abstract

We study extremal properties of the function F(x):=min{kx11/k ⁣:k1}, x[0,1], F(x) := \min\{k\|x\|^{1-1/k}\colon k\ge 1\},\ x\in[0,1], where x=min{x,1x}\|x\|=\min\{x,1-x\}. In particular, we show that FF is the pointwise largest function of the class of all real-valued functions ff defined on the interval [0,1][0,1], and satisfying the relaxed convexity condition f(tx1+(1t)x2)tf(x1)+(1t)f(x2)+x2x1, x1,x2,t[0,1] f(tx_1+(1-t)x_2) \le tf(x_1)+(1-t)f(x_2)+|x_2-x_1|, \ x_1,x_2,t\in[0,1] and the boundary condition max{f(0),f(1)}0\max\{f(0),f(1)\}\le 0. As an application, we prove that if AA and SS are subsets of a finite abelian group GG, such that SS is generating and all of its elements have order at most mm, then the number of edges from AA to its complement GAG\setminus A in the directed Cayley graph induced by SS on GG is S(A)1mGF(A/G). \partial_S(A) \ge \frac{1}{m} |G| F(|A|/|G|).

Keywords

Cite

@article{arxiv.1311.5986,
  title  = {Approximate convexity and an edge-isoperimetric estimate},
  author = {Vsevolod F. lev},
  journal= {arXiv preprint arXiv:1311.5986},
  year   = {2013}
}
R2 v1 2026-06-22T02:13:34.212Z