Compact data structures for Dedekind groups and finite rings

DOI10.1007/978-3-030-68211-8_8zbMath1482.68100OpenAlexW3129935353MaRDI QIDQ2232236

Bireswar Das, Shivdutt Sharma

Publication date: 4 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-68211-8_8

zbMATH Keywords

abelian groupsfinite ringsstrongly indecomposable groupscompact data structuresDedekind groupslinear-space representations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite rings and finite-dimensional associative algebras (16P10) General structure theorems for groups (20E34) Finite abelian groups (20K01) Data structures (68P05) Products of subgroups of abstract finite groups (20D40)

Cites Work

• Unnamed Item
• Linear and sublinear time algorithms for the basis of abelian groups
• Strongly indecomposable finite groups.
• Space efficient representations of finite groups
• On Hall subnormally embedded and generalized nilpotent groups.
• Complexity of ring morphism problems
• Probabilistic methods in group theory
• Linear time algorithms for Abelian group isomorphism and related problems
• EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS
• Existence, algorithms, and asymptotics of direct product decompositions, I
• Succinct representation of finite abelian groups
• Factoring Groups Efficiently
• The Number of Semigroups of Order n
• The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
• STACS 2005
• Nearly linear time isomorphism algorithms for some nonabelian group classes

This page was built for publication: Compact data structures for Dedekind groups and finite rings