An efficient algorithm for constructing minimal trellises for codes over finite abelian groups

1996 ◽  
Vol 42 (6) ◽  
pp. 1839-1854 ◽  
Author(s):  
V.V. Vazirani ◽  
H. Saran ◽  
B.S. Rajan
Keyword(s):  
Efficient Algorithm ◽  
Abelian Groups ◽  
Finite Abelian Groups

scholarly journals Decomposing finite Abelian groups

2001 ◽  
Vol 1 (3) ◽  
pp. 26-32
Author(s):  
K Cheung ◽  
M Mosca
Keyword(s):  
Efficient Algorithm ◽  
Riemann Hypothesis ◽  
Abelian Groups ◽  
Quantum Algorithm ◽  
Class Numbers ◽  
Finite Abelian Groups ◽  
Generalized Riemann Hypothesis ◽  
Cyclic Groups

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups into a product of cyclic groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).

scholarly journals EXAMPLES OF FINITE-DIMENSIONAL POINTED HOPF ALGEBRAS IN CHARACTERISTIC 2

2020 ◽  
pp. 1-14
Author(s):  
NICOLÁS ANDRUSKIEWITSCH ◽  
DIRCEU BAGIO ◽  
SARADIA DELLA FLORA ◽  
DAIANA FLÔRES
Keyword(s):  
Hopf Algebras ◽  
Abelian Groups ◽  
Vector Spaces ◽  
Group Algebras ◽  
Finite Abelian Groups ◽  
Finite Dimensional ◽  
Pointed Hopf Algebras ◽  
Characteristic 2 ◽  
Nichols Algebras ◽  
Kirillov Dimension

Abstract We present new examples of finite-dimensional Nichols algebras over fields of characteristic 2 from braided vector spaces that are not of diagonal type, admit realizations as Yetter–Drinfeld modules over finite abelian groups, and are analogous to Nichols algebras of finite Gelfand–Kirillov dimension in characteristic 0. New finite-dimensional pointed Hopf algebras over fields of characteristic 2 are obtained by bosonization with group algebras of suitable finite abelian groups.

scholarly journals Sum-free subsets of finite abelian groups of type III

2016 ◽  
Vol 58 ◽  
pp. 181-202 ◽  
Author(s):  
R. Balasubramanian ◽  
Gyan Prakash ◽  
D.S. Ramana
Keyword(s):  
Abelian Groups ◽  
Finite Abelian Groups ◽  
Type Iii

Quantum solution to the hidden subgroup problem for Poly-Near-Hamiltonian groups

2004 ◽  
Vol 4 (3) ◽  
pp. 229-235
Author(s):  
D. Gavinsky
Keyword(s):  
Quantum Computing ◽  
Efficient Algorithm ◽  
Abelian Groups ◽  
Hidden Subgroup Problem ◽  
Subgroup Problem ◽  
Hamiltonian Groups ◽  
Quantum Solution

The Hidden Subgroup Problem (HSP) has been widely studied in the context of quantum computing and is known to be efficiently solvable for Abelian groups, yet appears to be difficult for many non-Abelian ones. An efficient algorithm for the HSP over a group \f G\ runs in time polynomial in \f{n\deq\log|G|.} For any subgroup \f H\ of \f G, let \f{N(H)} denote the normalizer of \f H. Let \MG\ denote the intersection of all normalizers in \f G (i.e., \f{\MG=\cap_{H\leq G}N(H)}). \MG\ is always a subgroup of \f G and the index \f{[G:\MG]} can be taken as a measure of ``how non-Abelian'' \f G is (\f{[G:\MG] = 1} for Abelian groups). This measure was considered by Grigni, Schulman, Vazirani and Vazirani, who showed that whenever \f{[G:\MG]\in\exp(O(\log^{1/2}n))} the corresponding HSP can be solved efficiently (under certain assumptions). We show that whenever \f{[G:\MG]\in\poly(n)} the corresponding HSP can be solved efficiently, under the same assumptions (actually, we solve a slightly more general case of the HSP and also show that some assumptions may be relaxed).

Sign in / Sign up

Export Citation Format

Share Document