Combinatorial method in the coset enumeration of symmetrically generated groups

DOI10.1080/00207160701543376zbMath1146.05001OpenAlexW2108941045MaRDI QIDQ3518547

No author found.

Publication date: 8 August 2008

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701543376

zbMATH Keywords

enumerationcombinatorial algebrasymmetric generationscoset enumerationsinvolutory generators

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) General theory for finite permutation groups (20B05)

Cites Work

• Unnamed Item
• Symmetric representation of the elements of the Janko group \(J_ 1\)
• The Magma algebra system. I: The user language
• Coset enumeration of groups generated by symmetric sets of involutions.
• Double-coset enumeration algorithm for symmetrically generated groups.
• Symmetric generation and existence of the Janko group <I>J</I>1
• Double coset enumeration of symmetrically generated groups
• A Set of Generators and Relations for the Group PSL(2, Q ), q Odd
• A practical method for enumerating cosets of a finite abstract group

This page was built for publication: Combinatorial method in the coset enumeration of symmetrically generated groups