𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Decomposition of Associative Algebras over Finite Fields

✍ Scribed by W. Eberly; M. Giesbrecht


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
369 KB
Volume
29
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis


We present new, efficient algorithms for some fundamental computations with finitedimensional (but not necessarily commutative) associative algebras over finite fields. For a semisimple algebra A we show how to compute a complete Wedderburn decomposition of A as a direct sum of simple algebras, an isomorphism between each simple component and a full matrix algebra, and a basis for the centre of A. If A is given by a generating set of matrices in F mΓ—m , then our algorithm requires about O(m 3 ) operations in F, in addition to the cost of factoring a polynomial in F[x] of degree O(m), and the cost of generating a small number of random elements from A. We also show how to compute a complete set of orthogonal primitive idempotents in any associative algebra over a finite field in this same time.


πŸ“œ SIMILAR VOLUMES


Partial Zeta Functions of Algebraic Vari
✍ Daqing Wan πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 147 KB

## DEDICATED TO PROFESSOR CHAO KO ON THE OCCASION OF HIS 90TH BIRTHDAY Motivated by arithmetic applications, we introduce the notion of a partial zeta function which generalizes the classical zeta function of an algebraic variety de"ned over a "nite "eld. We then explain two approaches to the gene

Algebraic and Badly Approximable Power S
✍ Alain Lasjaunias; Jean-Jacques Ruch πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 324 KB

We will exhibit certain continued fraction expansions for power series over a "nite "eld, with all the partial quotients of degree one, which are non-quadratic algebraic elements over the "eld of rational functions.

Explicit Constructions of Perfect Hash F
✍ Huaxiong Wang; Chaoping Xing πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 149 KB

Let A be a set of order n and B be a set of order m. An (n, m, w)-perfect hash family is a set H of functions from A to B such that for any X A with |X |=w, there exists an element h # H such that h is one-to-one when restricted to X. Perfect hash families have many applications to computer science,

Unique Tensor Factorization of Loop-Resi
✍ Michael NΓΌsken πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 171 KB

Tensor product decomposition of algebras is known to be non-unique in many cases. But we know that a βŠ•-indecomposable, finite-dimensional -algebra A has an essentially unique tensor factorization Thus the semiring of isomorphism classes of finite-dimensional -algebras is a polynomial semiring . Mor