Computing stable epimorphisms onto finite groups

DOI10.1016/J.JSC.2017.11.017MaRDI QIDQ1757001zbMATH OpenOpenAlexFDO

Authors 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

algorithmquotient groupepimorphismfinitely presented groupregular covering projection

Mathematics Subject Classification ID

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

Recommendations

• Universal covers of finite groups
• Counting homomorphisms onto finite solvable groups.
• Algorithms determining finite simple images of finitely presented groups
• Homological Coverings of Graphs
• Towards a soluble quotient algorithm

Cites work

• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3712179 (Why is no real title available?)
• scientific article; zbMATH DE number 3585658 (Why is no real title available?)
• scientific article; zbMATH DE number 534859 (Why is no real title available?)
• scientific article; zbMATH DE number 2133330 (Why is no real title available?)
• scientific article; zbMATH DE number 947812 (Why is no real title available?)
• scientific article; zbMATH DE number 848088 (Why is no real title available?)
• scientific article; zbMATH DE number 278890 (Why is no real title available?)
• A computer application to finite p-groups
• A finite soluble quotient algorithm
• A polycyclic quotient algorithm
• Algorithms for finite soluble groups and applications
• Computing polycyclic quotients of finitely (\(L\)-)presented groups via Groebner bases.
• Group actions, coverings and lifts of automorphisms
• Lifting graph automorphisms by voltage assignments
• Some computational aspects of solvable regular covers of graphs
• Subcomplete generalizations of graph isomorphism
• Towards a soluble quotient algorithm

Cited in

(2)

• A subquadratic algorithm for the simultaneous conjugacy problem
• Counting homomorphisms onto finite solvable groups.

Describes a project that uses

Uses Software

• PCQL
• Magma

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1757001)