2000 character limit reached
Groups of type $FP$ via graphical small cancellation
Published 9 Apr 2020 in math.GR | (2004.04550v6)
Abstract: We construct an uncountable family of groups of type $FP$. In contrast to every previous construction of non-finitely presented groups of type $FP$ we do not use Morse theory on cubical complexes; instead we use Gromov's graphical small cancellation theory.
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.