Computing stable epimorphisms onto finite groups

DOI10.1016/j.jsc.2017.11.017zbMath1502.20001OpenAlexW2768349158MaRDI QIDQ1757001

Rok Požar

Publication date: 28 December 2018

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2017.11.017

zbMATH Keywords

algorithmfinitely presented groupquotient groupepimorphismregular covering projection

Mathematics Subject Classification ID

General structure theorems for groups (20E34) Generators, relations, and presentations of groups (20F05) Automorphism groups of groups (20F28) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (1)

A subquadratic algorithm for the simultaneous conjugacy problem

Uses Software

• Magma
• PCQL

Cites Work

• Towards a soluble quotient algorithm
• Group actions, coverings and lifts of automorphisms
• A polycyclic quotient algorithm
• Lifting graph automorphisms by voltage assignments
• Subcomplete generalizations of graph isomorphism
• A finite soluble quotient algorithm
• Some computational aspects of solvable regular covers of graphs
• A computer application to finite p-groups
• Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing stable epimorphisms onto finite groups