An algorithm for finding minimal generating sets of finite groups
From MaRDI portal
Publication:5076993
DOI10.29252/AS.2021.2029zbMATH Open1499.05299arXiv2009.05922MaRDI QIDQ5076993FDOQ5076993
Teerapong Suksumran, Tanakorn Udomworarat
Publication date: 17 May 2022
Abstract: In this article, we study connections between components of the Cayley graph , where is an arbitrary subset of a group , and cosets of the subgroup of generated by . In particular, we show how to construct generating sets of if has finitely many components. Furthermore, we provide an algorithm for finding minimal generating sets of finite groups using their Cayley graphs.
Full work available at URL: https://arxiv.org/abs/2009.05922
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05)
Cites Work
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- On isomorphisms of finite Cayley graphs---a survey
- On transitive Cayley graphs of groups and semigroups
- On Cayley graphs of inverse semigroups.
- Approaching the Moore bound for diameter two by Cayley graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some properties of unitary Cayley graphs
- Some problems on Cayley graphs
- On transitive Cayley graphs of strong semilattices of right (left) groups
- Title not available (Why is that?)
- Cayley graphs as models of deterministic small-world networks
- On Cayley graphs of rectangular groups
- Computing a set of generators of minimal cardinality in a solvable group
- The largest size of a minimal generating set of a finite group.
- A combinatorial property and Cayley graphs of semigroups
- Connectivity of minimal Cayley graphs
- On the Automorphism Groups of Cayley Graphs of Finite Simple Groups
- On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
- Minimal generating sets of groups, rings, and fields
- Generating sets of finite groups
- The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
Cited In (2)
Uses Software
This page was built for publication: An algorithm for finding minimal generating sets of finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076993)