Asymptotic cones of snowflake groups and the strong shortcut property
Christopher H. Cashen, Nima Hoda, Daniel J. Woodhouse
TL;DR
This paper constructs an infinite family of snowflake groups $G_L$ (even $L" lat 6$) that are not virtually nilpotent and have superquadratic Dehn functions, yet all asymptotic cones are simply connected. The authors establish a Loop Subdivision Criterion linking cone simple connectedness to uniformly bounded-area fillings of boundary words, and then develop a detailed fat/skinny analysis of biLipschitz loops. By analyzing geodesics, line intersections, and distortion of powers of $a$, $x$, and $y$, they implement an inductive filling procedure for $K$-biLipschitz loops, decomposing diagrams into central regions, enfilades, and branching regions, and filling each piece with carefully bounded area/mesh. The results yield that all asymptotic cones of $G_L$ are simply connected, while some asymptotic cone contains an isometrically embedded circle, showing that simple connectivity does not imply the strong shortcut property for Cayley graphs. The work thus provides the first counterexamples separating asymptotic-cone simple connectivity from strong shortcut behavior in groups and raises open questions about the generating-set dependence of strong shortcut and related coarse-geometric phenomena.
Abstract
We exhibit an infinite family of snowflake groups all of whose asymptotic cones are simply connected. Our groups have neither polynomial growth nor quadratic Dehn function, the two usual sources of this phenomenon. We further show that each of our groups has an asymptotic cone containing an isometrically embedded circle or, equivalently, has a Cayley graph that is not strongly shortcut. These are the first examples of groups whose asymptotic cones contain `metrically nontrivial' loops but no topologically nontrivial ones.
