Free-by-cyclic graphical discreteness conjecture
Free-by-cyclic graphical discreteness conjecture
Let be the free group of rank , let be an automorphism, and consider the free-by-cyclic group
Assume that this group is one-ended and hyperbolic, and has trivial JSJ decomposition. A group is graphically discrete when it has only trivial lattice envelopes.
Free-by-cyclic graphical discreteness conjecture. A one-ended, hyperbolic free-by-cyclic group with trivial JSJ decomposition is graphically discrete.
The supplied text presents this as an open question among the paper's conjectures and gives no known cases or resolution.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Alex Margolis, Sam Shepherd, Emily Stark and Daniel Woodhouse, “Graphically discrete groups and rigidity”, arXiv:2303.04843 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.