Grid-or-tree embeddings in superlinear Cayley graphs
Status Open · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedOpenOpenStatement
Definitions and mathematical statement
Let $\Gamma$ be a finitely generated infinite group and $S=S^{-1}$ a finite generating set not containing its identity. Let $G=\operatorname{Cay}(\Gamma,S)$ be the undirected graph with edges $\{g,gs\}$ for $g\in\Gamma$, $s\in S$. Give $G$ its graph metric. Suppose it has superlinear volume growth: \[ \frac{|B_G(1,n)|}{n}\longrightarrow\infty. \] Let $Q$ be the nearest-neighbor square lattice on $\mathbb Z^2$, and let $T$ be the infinite rooted binary tree, with each vertex having two children.Must at least one of $Q,T$ admit a rough isometric embedding in $G$? Here, as in the source's coarse-geometric terminology, this means a map $f:V(H)\to V(G)$ for $H=Q$ or $H=T$, and constants $A\ge1$, $B\ge0$, such that for all $x,y\in V(H)$, \[ A^{-1}d_H(x,y)-B\le d_G(f(x),f(y))\le A d_H(x,y)+B. \] This is a quasi-isometric embedding; coarse surjectivity onto $G$ is not required. The constants may depend on the group and its generating set. The map need not carry each edge to one edge, so the formulation is a metric embedding problem rather than a demand for a literal lattice or binary-tree subgraph.
The two possible targets have different growth: a binary-tree embedding forces exponential growth in the ambient graph, while the lattice alternative also allows intermediate or polynomial growth. The question concerns every finite generating set of every superlinear Cayley graph.
Short English statement
Does every Cayley graph growing faster than a line contain a coarse metric copy of a square grid or a binary tree?Sources
- S1 ULAM.AI and the UnsolvedMath Contributors, supplied problems.json, record 10000014 (AMR-099-0014), AMR Open Problem Lists. Catalogue identity and source transcription; CC BY 4.0. https://huggingface.co/datasets/ulamai/UnsolvedMath.
- S2 Benjamini - Coarse Geometry and Randomness (Saint-Flour notes), Open problem 1.80, PDF page 17. Original source indexed by AMR-099-0014. https://www.wisdom.weizmann.ac.il/~itai/stflouraug24.pdf#page=17.
- S3 I. Benjamini, Coarse Geometry and Randomness, primary Saint-Flour notes; the numbered question and its surrounding definitions. https://arquivo.pt/noFrame/replay/20201231041548id_/http://www.wisdom.weizmann.ac.il/~itai/stflouraug24.pdf.
Statement licence: CC-BY-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.