Math 2.0

Resources / preprint

Almost Tight Bounds for Isomorphism Testing and Basis Construction in Finite Abelian Groups EGADPYP7R3

URIm2://res/EGADPYP7R3
Kindpreprint
CreatorsNader H. Bshouty
Date2026-10-06
Subjectsarxiv cs.DS, arxiv math.GR
Scopeborder

Expressions

e1: version, preprint

Date2026-10-06
IdsarXiv 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.

ItemKindWhereSource
Bshouty's decision lower boundstatementproposition 6.1arxiv
Simulated output probabilitystatementlemma 4.2arxiv
Consequence of Sutherland's algorithmsstatementproposition 5.2arxiv
5X2T9PF90Cexampleexample 3.1arxiv
77998B4FAAstatementcorollary 6.2arxiv
Couplingstatementlemma 3.2arxiv
Random generationstatementlemma 5.3arxiv
Sampling a primary imagestatementlemma 5.4arxiv
Constructing and evaluating an isomorphismstatementcorollary 6.3arxiv
E3KB7164EMexampleexample 2.2arxiv
Fundamental theorem of finite Abelian groupsstatementtheorem 2.1arxiv
Reconstruction and rankstatementlemma 5.1arxiv
Isomorphism type and decisionstatementtheorem 1.2arxiv
Quantitative success boundstatementtheorem 4.3arxiv
Basis constructionstatementtheorem 1.1arxiv
Unconditional collision boundstatementlemma 4.1arxiv

Catalogue records