2000 character limit reached
A method for building permutation representations of finitely presented groups
Published 3 May 2016 in math.GR | (1605.00797v1)
Abstract: We design an algorithm to find certain partial permutation representations of a finitely presented group $G$ (the bricks) that may be combined to a transitive permutation representation of $G$ (the mosaic) on the disjoint union.
Sponsor
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.