Computing stable epimorphisms onto finite groups
type: Item
instance of: scholarly article
title: Computing stable epimorphisms onto finite groups
zbMATH Open document ID: 1502.20001
author: Rok Požar
published in: Journal of Symbolic Computation
publication date: 2018-12-28T00:00:00Z
Mathematics Subject Classification ID: 20-04
Mathematics Subject Classification ID: 20F05
Mathematics Subject Classification ID: 20E34
Mathematics Subject Classification ID: 20F28
zbMATH DE Number: 6997073
zbMATH Keywords: algorithm
zbMATH Keywords: epimorphism
zbMATH Keywords: finitely presented group
zbMATH Keywords: regular covering projection
zbMATH Keywords: quotient group
describes a project that uses: Magma
describes a project that uses: PCQL
MaRDI profile type: Publication
full work available at URL: j.jsc.2017.11.017
OpenAlex ID: W2768349158
cites work: Algorithms for finite soluble groups and applications
cites work: Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases
cites work: Q4154737
cites work: Subcomplete generalizations of graph isomorphism
cites work: Q4650358
cites work: Q5289115
cites work: Q4716208
cites work: Q3757929
cites work: A polycyclic quotient algorithm
cites work: A computer application to finite p-groups
cites work: Group actions, coverings and lifts of automorphisms
cites work: Lifting graph automorphisms by voltage assignments
cites work: Q3903159
cites work: Q4867140
cites work: A finite soluble quotient algorithm
cites work: Towards a soluble quotient algorithm
cites work: Q4285784
cites work: Some computational aspects of solvable regular covers of graphs
DOI: 10.1016/J.JSC.2017.11.017
description: scientific article; zbMATH DE number 6997073