Edge-isoperimetric problem for Cayley graphs and generalized Takagi function

Abstract

Let G be a finite abelian abelian group of exponent m 2. For subsets A,S⊂ G, denote by ∂S(A) the number of edges from A to its complement G A in the directed Cayley graph, induced by S on G. We show that if S generates G, and A is non-empty, then ∂S(A) em\,|A||G||A|. Here the coefficient e=2.718... is best possible and cannot be replaced with a number larger than e. For homocyclic groups G of exponent m, we find an explicit closed-form expression for ∂S(A) in the case where S is a "standard" generating subset of G, and A is an initial segment of G with respect to the lexicographic order, induced by S on G. Namely, we show that in this situation ∂S(A) = |G|\,ωm(|A|/|G|), where ω2 is the Takagi function, and ωm for m 3 is an appropriate generalization thereof. This particular case is of special interest, since for m∈\2,3,4\ it is known to yield the smallest possible value of ∂S(A), over all sets A⊂ G of given size. We give this classical result a new proof, somewhat different from the standard one. We also give a new, short proof of the Boros-Pales inequality ω2(x+y2) ω2(x) + ω2(y)2 + 12\,|y-x|, establish an extremal characterization of the Takagi function as the (pointwise) maximal function, satisfying this inequality and the boundary condition \ω2(0),ω2(1)\ 0, and obtain similar results for the 3-adic analog ω3 of the Takagi function.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…