Efficient decomposition of associative algebras over finite fields
type: Item
instance of: scholarly article
title: Efficient decomposition of associative algebras over finite fields
zbMATH Open document ID: 0996.16032
published in: Journal of Symbolic Computation
publication date: 2002-07-17T00:00:00Z
Mathematics Subject Classification ID: 16Z05
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 16P10
zbMATH DE Number: 1445836
zbMATH Keywords: algebras over finite fields
zbMATH Keywords: algorithms
zbMATH Keywords: semisimple algebras
zbMATH Keywords: Wedderburn decompositions
zbMATH Keywords: direct sums
zbMATH Keywords: random elements
zbMATH Keywords: orthogonal primitive idempotents
author: Wayne Eberly
author: Mark Giesbrecht
MaRDI profile type: Publication
full work available at URL: jsco.1999.0308
OpenAlex ID: W1976312168
cites work: Q4101884
cites work: Factoring Polynomials Over Large Finite Fields
cites work: Finding the radical of an algebra of linear transformations
cites work: Matrix multiplication via arithmetic progressions
cites work: Q3254327
cites work: Nearly Optimal Algorithms for Canonical Matrix Forms
cites work: Factoring in skew-polynomial rings over finite fields
cites work: Scalar polynomial equations for matrices over a finite field
cites work: Q4312071
cites work: Q3236717
cites work: Q3216750
cites work: Some problems in computational representation theory
cites work: Q3218280
cites work: Q3961610
cites work: Computing the structure of finite algebras
cites work: Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
cites work: Computing with endomorphism rings of modular representations
cites work: Fast multiplication of polynomials over fields of characteristic 2
cites work: Fast multiplication of large numbers
DOI: 10.1006/JSCO.1999.0308
description: scientific article; zbMATH DE number 1445836