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 mathrmCay(G,A), where A is an arbitrary subset of a group G, and cosets of the subgroup of G generated by A. In particular, we show how to construct generating sets of G if mathrmCay(G,A) 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




Cites Work


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)