Computational Complexity of Finding Subgroups of a Given Order
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914348701581312 |
|---|---|
| author | Lakshmanan, K. |
| author_facet | Lakshmanan, K. |
| contents | We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal algorithm for finding a subgroup of a given order when the input is given in the form of a Cayley table. To the best of our knowledge, no prior work has addressed the complexity of this problem under the Cayley table representation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_11238 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Computational Complexity of Finding Subgroups of a Given Order Lakshmanan, K. Computational Complexity Group Theory 68Q17, 20-08 We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal algorithm for finding a subgroup of a given order when the input is given in the form of a Cayley table. To the best of our knowledge, no prior work has addressed the complexity of this problem under the Cayley table representation. |
| title | Computational Complexity of Finding Subgroups of a Given Order |
| topic | Computational Complexity Group Theory 68Q17, 20-08 |
| url | https://arxiv.org/abs/2503.11238 |