Efficient decomposition of associative algebras over finite fields

DOI10.1006/jsco.1999.0308zbMath0996.16032OpenAlexW1976312168MaRDI QIDQ1976671

Mark W. Giesbrecht, Wayne Eberly

Publication date: 17 July 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1999.0308

zbMATH Keywords

algorithmsdirect sumsrandom elementsWedderburn decompositionssemisimple algebrasorthogonal primitive idempotentsalgebras over finite fields

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite rings and finite-dimensional associative algebras (16P10) Computational aspects of associative rings (general theory) (16Z05)

Related Items

How to compute the Wedderburn decomposition of a finite-dimensional associative algebra ⋮ On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization ⋮ Cryptographic algorithms on groups and algebras ⋮ Groups acting on tensor products. ⋮ CONSTRUCTING THE GROUP PRESERVING A SYSTEM OF FORMS ⋮ Splitting full matrix algebras over algebraic number fields. ⋮ Efficient decomposition of separable algebras. ⋮ Computing isometry groups of Hermitian maps ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ Asymptotically fast group operations on Jacobians of general curves ⋮ Computing in Picard groups of projective curves over finite fields ⋮ Noncommutativity makes determinants hard

Cites Work

• Scalar polynomial equations for matrices over a finite field
• Matrix multiplication via arithmetic progressions
• Computing with endomorphism rings of modular representations
• Fast multiplication of polynomials over fields of characteristic 2
• Factoring in skew-polynomial rings over finite fields
• Finding the radical of an algebra of linear transformations
• Some problems in computational representation theory
• Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
• Fast multiplication of large numbers
• Computing the structure of finite algebras
• Nearly Optimal Algorithms for Canonical Matrix Forms
• Factoring Polynomials Over Large Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item