Paper Info
Title
Succinct representation of finite abelian groups
Abstract
We consider the problem of representing and performing computations on finite abelian groups. Assuming a lg n-bit1 word model and considering any abelian group of order n, we show how to represent the group in constant number of words and perform three fundamental group operations of equality testing, multiplication, and inversion in constant number of word operations, provided we have the platform instruction to reverse the bits of a word.
Year
DOI
Venue
2006
10.1145/1145768.1145788
ISSAC
Keywords
Field
DocType
order n,abelian group,succinct representation,constant number,n-bit1 word model,fundamental group operation,finite abelian group,equality testing,word operation,platform instruction,succinct data structure,fundamental group
Abelian group,Discrete mathematics,Free abelian group,Combinatorics,Algebra,Elementary abelian group,Cyclic group,G-module,Hidden subgroup problem,Rank of an abelian group,Torsion subgroup,Mathematics
Conference
ISBN
Citations 
PageRank 
1-59593-276-3
2
0.39
References 
Authors
10
2
Name
Order
Citations
PageRank
Arash Farzan113611.07
J. Ian Munro23010462.97