Almost Tight Bounds for Isomorphism Testing and Basis Construction in Finite Abelian Groups EGADPYP7R3
| URI | m2://res/EGADPYP7R3 |
|---|---|
| Kind | preprint |
| Creators | Nader H. Bshouty |
| Date | 2026-10-06 |
| Subjects | arxiv cs.DS, arxiv math.GR |
| Scope | border |
Expressions
e1: version, preprint
| Date | 2026-10-06 |
|---|---|
| Ids | arXiv 2610.08280 |
Items in this resource
The mentions of the inventory that name this resource. Each name links to the card of its inventory row.
| Item | Kind | Where | Source |
|---|---|---|---|
| Bshouty's decision lower bound | statement | proposition 6.1 | arxiv |
| Simulated output probability | statement | lemma 4.2 | arxiv |
| Consequence of Sutherland's algorithms | statement | proposition 5.2 | arxiv |
| 5X2T9PF90C | example | example 3.1 | arxiv |
| 77998B4FAA | statement | corollary 6.2 | arxiv |
| Coupling | statement | lemma 3.2 | arxiv |
| Random generation | statement | lemma 5.3 | arxiv |
| Sampling a primary image | statement | lemma 5.4 | arxiv |
| Constructing and evaluating an isomorphism | statement | corollary 6.3 | arxiv |
| E3KB7164EM | example | example 2.2 | arxiv |
| Fundamental theorem of finite Abelian groups | statement | theorem 2.1 | arxiv |
| Reconstruction and rank | statement | lemma 5.1 | arxiv |
| Isomorphism type and decision | statement | theorem 1.2 | arxiv |
| Quantitative success bound | statement | theorem 4.3 | arxiv |
| Basis construction | statement | theorem 1.1 | arxiv |
| Unconditional collision bound | statement | lemma 4.1 | arxiv |
Catalogue records
- arxiv: 2610.08280 (work)