2000 character limit reached
JSJ decompositions and polytopes for two-generator one-relator groups
Published 6 Jan 2021 in math.GR and math.AT | (2101.02193v2)
Abstract: We provide a direct connection between the $\mathcal{Z}_{\max}$ (or essential) JSJ decomposition and the Friedl--Tillmann polytope of a hyperbolic two-generator one-relator group with abelianisation of rank $2$. We deduce various structural and algorithmic properties, like the existence of a quadratic-time algorithm computing the \ZC{}-JSJ decomposition of such groups.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.