A method for building permutation representations of finitely presented groups
classification
🧮 math.GR
keywords
permutationfinitelypresentedrepresentationsalgorithmbricksbuildingcertain
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.