Double-coset enumeration algorithm for symmetrically generated groups.
DOI10.1155/IJMMS.2005.699zbMATH Open1094.20015OpenAlexW2017084711MaRDI QIDQ2570945FDOQ2570945
Authors: Yanyan Li 
Publication date: 31 October 2005
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/52597
Recommendations
- Double coset enumeration of symmetrically generated groups
- scientific article; zbMATH DE number 2201235
- Coset enumeration of symmetrically generated groups using Gröbner bases.
- Combinatorial method in the coset enumeration of symmetrically generated groups
- Coset enumeration of groups generated by symmetric sets of involutions.
- Combinatorial method in the coset enumeration of symmetrically generated groups II: Monomial modular representations
- scientific article; zbMATH DE number 3871630
- Statistical enumeration of groups by double cosets
- scientific article; zbMATH DE number 3922932
generators and relationssymmetric presentationssymmetric sets of involutionsdouble coset enumeration algorithms
Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) Simple groups: sporadic groups (20D08)
Cited In (4)
- On some systems of generators of symmetric and alternating groups which allow a simple software implementation
- Coset enumeration of groups generated by symmetric sets of involutions.
- Combinatorial method in the coset enumeration of symmetrically generated groups
- A combinatorial approach to the double cosets of the symmetric group with respect to Young subgroups
This page was built for publication: Double-coset enumeration algorithm for symmetrically generated groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2570945)
