Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.02387 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912715753127936 |
|---|---|
| author | Bshouty, Nader H. |
| author_facet | Bshouty, Nader H. |
| contents | In this paper, we study the problems of abelian group isomorphism and basis construction in two models. In the {\it partially specified model} (PS-model), the algorithm does not know the group size but can access randomly chosen elements of the group along with the Cayley table of those elements, which provides the result of the binary operation for every pair of selected elements. In the stronger {\it fully specified model} (FS-model), the algorithm knows the size of the group and has access to its elements and Cayley table.
Given two abelian groups, $G$, and $H$, we present an algorithm in the PS-model (and hence in the FS-model) that runs in time $\tilde O(\sqrt{|G|})$ and decides if they are isomorphic. This improves on Kavitha's linear-time algorithm and gives the first sublinear-time solution for this problem. We then prove the lower bound $Ω(|G|^{1/4})$ for the FS-model and the tight bound $Ω(\sqrt{|G|})$ for the PS-model. This is the first known lower bound for this problem. We obtain similar results for finding a basis for abelian groups. For deterministic algorithms, a simple $Ω(|G|)$ lower bound is given. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_02387 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction Bshouty, Nader H. Computational Complexity In this paper, we study the problems of abelian group isomorphism and basis construction in two models. In the {\it partially specified model} (PS-model), the algorithm does not know the group size but can access randomly chosen elements of the group along with the Cayley table of those elements, which provides the result of the binary operation for every pair of selected elements. In the stronger {\it fully specified model} (FS-model), the algorithm knows the size of the group and has access to its elements and Cayley table. Given two abelian groups, $G$, and $H$, we present an algorithm in the PS-model (and hence in the FS-model) that runs in time $\tilde O(\sqrt{|G|})$ and decides if they are isomorphic. This improves on Kavitha's linear-time algorithm and gives the first sublinear-time solution for this problem. We then prove the lower bound $Ω(|G|^{1/4})$ for the FS-model and the tight bound $Ω(\sqrt{|G|})$ for the PS-model. This is the first known lower bound for this problem. We obtain similar results for finding a basis for abelian groups. For deterministic algorithms, a simple $Ω(|G|)$ lower bound is given. |
| title | Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2504.02387 |