SearcharxivSearch

arXiv · 1112.1970

On Small Separations in Cayley Graphs

Abstract

We present two results on expansion of Cayley graphs. The first result settles a conjecture made by DeVos and Mohar. Specifically, we prove that for any positive constant $c$ there exists a finite connected subset $A$ of the Cayley graph of $\mathbb{Z}^2$ such that $\frac{|\partial A|}{|A|}< \frac{c}{depth(A)}$. This yields that there can be no universal bound for $\frac{|\partial A|depth(A)}{|A|}$ for subsets of either infinite or finite vertex transitive graphs. Let $X=(V,E)$ be the Cayley graph of a finitely generated infinite group and $A\subset V$ finite such that $A\cup\partial A$ is connected. Our second result is that if $|A|> 16|\partial A|^2$ then $X$ has a ring-like structure.

Explore related subjects

Keep this discovery

BibTeXRIS

Martha Giannoudovardi. 2011-12-08. On Small Separations in Cayley Graphs. https://arxiv.org/abs/1112.1970

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR