A method for building permutation representations of finitely presented groups
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.