| dc.contributor.author |
Lucchini, Andrea |
|
| dc.contributor.author |
Thakkar, Dhara |
|
| dc.coverage.spatial |
United States of America |
|
| dc.date.accessioned |
2023-12-07T05:27:24Z |
|
| dc.date.available |
2023-12-07T05:27:24Z |
|
| dc.date.issued |
2024-02 |
|
| dc.identifier.citation |
Lucchini, Andrea and Thakkar, Dhara, "The minimum generating set problem", Journal of Algebra, DOI: 10.1016/j.jalgebra.2023.11.012, vol. 640, pp. 117-128, Feb. 2024. |
|
| dc.identifier.issn |
0021-8693 |
|
| dc.identifier.issn |
1090-266X |
|
| dc.identifier.uri |
https://doi.org/10.1016/j.jalgebra.2023.11.012 |
|
| dc.identifier.uri |
https://repository.iitgn.ac.in/handle/123456789/9523 |
|
| dc.description.abstract |
Let G be a finite group. In order to determine the smallest cardinality d(G) of a generating set of G and a generating set with this cardinality, one should repeat ‘many times’ the test whether a subset of G of ‘small’ cardinality generates G. We prove that if a chief series of G is known, then the numbers of these ‘generating tests’ can be drastically reduced. At most |G|13/5 subsets must be tested. This implies that the minimum generating set problem for a finite group G can be solved in polynomial time. |
|
| dc.description.statementofresponsibility |
by Andrea Lucchini and Dhara Thakkar |
|
| dc.format.extent |
vol. 640, pp. 117-128 |
|
| dc.language.iso |
en_US |
|
| dc.publisher |
Elsevier |
|
| dc.subject |
Finite groups |
|
| dc.subject |
Minimum generating set |
|
| dc.subject |
Crowns |
|
| dc.title |
The minimum generating set problem |
|
| dc.type |
Article |
|
| dc.relation.journal |
Journal of Algebra |
|