Zobrazeno 1 - 6
of 6
pro vyhledávání: '"S, Suraj Krishna M"'
We show that the mapping torus of a hyperbolic group by a hyperbolic automorphism is cubulable. Along the way, we (i) give an alternate proof of Hagen and Wise's theorem that hyperbolic free-by-cyclic groups are cubulable, and (ii) extend to the case
Externí odkaz:
http://arxiv.org/abs/2306.15054
Autor:
Dahmani, François, S, Suraj Krishna M
Let $G = H_1 * ... * H_k * F_r$ be a torsion-free group and $\phi$ an automorphism of $G$ that preserves this free factor system. We show that when $\phi$ is fully irreducible and atoroidal relative to this free factor system, the mapping torus $\Gam
Externí odkaz:
http://arxiv.org/abs/2212.09869
Autor:
Hoda, Nima, S, Suraj Krishna M
Publikováno v:
Math. Proc. Camb. Phil. Soc. 175 (2023), no. 2, 367--380
We show that a group that is hyperbolic relative to strongly shortcut groups is itself strongly shortcut, thus obtaining new examples of strongly shortcut groups. The proof relies on a result of independent interest: we show that every relatively hyp
Externí odkaz:
http://arxiv.org/abs/2010.03421
Autor:
Dahmani, François, S, Suraj Krishna M
Publikováno v:
Groups Geom. Dyn. 17 (2023), no. 2, 403--426
Let $G$ be a torsion-free hyperbolic group and $\alpha$ an automorphism of $G$. We show that there exists a canonical collection of subgroups that are polynomially growing under $\alpha$, and that the mapping torus of $G$ by $\alpha$ is hyperbolic re
Externí odkaz:
http://arxiv.org/abs/2006.07288
Autor:
S, Suraj Krishna M
Publikováno v:
Algebr. Geom. Topol. 20 (2020) 1877-1938
We present an algorithm to construct the JSJ decomposition of one-ended hyperbolic groups which are fundamental groups of graphs of free groups with cyclic edge groups. Our algorithm runs in double exponential time, and is the first algorithm on JSJ
Externí odkaz:
http://arxiv.org/abs/1811.04677
Autor:
S, Suraj Krishna M
Publikováno v:
Annales de la Facult\'e des sciences de Toulouse : Math\'ematiques, 6-32 (2023) no. 3, 555--576
We develop an algorithm of polynomial time complexity to construct the Grushko decomposition of fundamental groups of graphs of free groups with cyclic edge groups. Our methods rely on analysing vertex links of certain CAT(0) square complexes natural
Externí odkaz:
http://arxiv.org/abs/1807.06186