On minimal generating sets for symmetric and alternating groups

DOI10.1007/s41980-018-0100-3zbMath1452.20003OpenAlexW2781539977MaRDI QIDQ1734155

Reza Taleb, Moharram N. Iradmusa

Publication date: 22 March 2019

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-018-0100-3

zbMATH Keywords

solvable polynomialssubgroups of symmetric groupsconnectivity in a graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Subgroups of symmetric groups (20B35)

Cites Work

• An algebraic metric for phylogenetic trees
• Permutation groups generated by a transposition and another element
• Generating the alternating group by cyclic triples
• A construction of polynomials with squarefree discriminants
• Fundamentals of Group Theory
• Circulants and their connectivities
• Genome Rearrangements and Sorting by Reversals
• A survey: Hamiltonian cycles in Cayley graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On minimal generating sets for symmetric and alternating groups