Combinatorial isoperimetric inequality for the free factor complex
Abstract
We show that the free factor complex of the free group of rank greater than or equal to 4 does not satisfy a combinatorial isoperimetric inequality: that is, for every natural number N, there is a loop cN of length 4 in the free factor complex such that the number of 2-simplices required to fill cN grows at least as a linear function of N. To prove the result, we construct a coarsely Lipschitz function from the `upward link' of a free factor to the set of integers.
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.