Computing double cosets in soluble groups

DOI10.1006/JSCO.1999.1005zbMath0987.20007OpenAlexW2060578797MaRDI QIDQ5928888

Michael C. Slattery

Publication date: 14 June 2001

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

Full work available at URL: https://doi.org/10.1006/jsco.1999.1005

zbMATH Keywords

algorithmsdouble cosetsfinite soluble groupsorbit-stabilizerspolycyclic presentationstransversals

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (2)

Statistical enumeration of groups by double cosets ⋮ Canonical representation of polynomial expressions with indices

Uses Software

• Magma

Cites Work

• Unnamed Item
• Computing modular and projective character degrees of soluble groups
• Computing intersections and normalizers in soluble groups
• Computing character degrees in p-groups
• Double coset enumeration
• Extraspecial towers and Weil representations
• On Holt's algorithm
• The Magma algebra system. I: The user language
• Enumeration of double cosets
• A finite soluble quotient algorithm
• Some remarks on the computation of complements and normalizers in soluble groups
• Some remarks on the computation of conjugacy classes of soluble groups
• On Representatives of Subsets

This page was built for publication: Computing double cosets in soluble groups