Graphically discrete groups and rigidity

From MaRDI portal





A finitely generated group \(\Gamma\) is defined to be graphically discrete if for every geometric action of \(\Gamma\) on a connected locally finite graph \(X\), the full automorphism group \(\mathrm{Aut}(X)\) is compact-by-discrete. The paper develops several equivalent formulations and a range of examples, placing the notion in the context of the lattice envelope problem (compare with [\textit{U.~Bader} et al., Duke Math. J. 169, No. 2, 213--278 (2020; Zbl 1515.22002]). It is also shown by examples that graphical discreteness is not stable under commensurability and does not pass to finite-index subgroups.\N\NThe main rigidity results concern graphs of groups whose vertex groups are graphically discrete. Theorem C proves action rigidity, within the class of virtually torsion-free groups, for free products of one-ended virtually torsion-free graphically discrete groups. Theorem E gives action rigidity for a minimal finite graph of groups with vertex groups graphically discrete, hyperbolic and cumulated, assuming the incident edge subgroups form an almost malnormal family of infinite quasi-convex subgroups and the associated Bass-Serre tree of spaces is preserved by quasi-isometries.\N\NFinally, Theorem A establishes quasi-isometric rigidity for many hyperbolic graphs of groups with closed hyperbolic \(n\)-manifold vertex groups (\(n\ge 3\)) and suitable quasi-convex edge groups; in particular, Corollary B treats amalgams of two closed hyperbolic \(3\)-manifold groups along a quasi-convex malnormal non-abelian free subgroup.



Cites work









This page was built for publication: Graphically discrete groups and rigidity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863278)