A method for building permutation representations of finitely presented\n groups

2016/05/03 by Gabriele Nebe, Richard Parker, Nebe, Gabriele +3
Engineering · Mathematics · #Advanced Algebra and Geometry #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1605.00797

openalex publication_date 2016/05/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We design an algorithm to find certain partial permutation representations of\na finitely presented group G (the bricks) that may be combined to a\ntransitive permutation representation of G (the mosaic) on the disjoint\nunion.\n

Related

• An algebraic approach to representations of the permutation group
• An Algorithm to Decompose Permutation Representations of Finite Groups: Polynomial Algebra Approach
• Amusing Permutation Representations of Group Extensions
• Combinatorial generation via permutation languages. I. Fundamentals
• Frobenius polytopes