Computing the structure of finite algebras

DOI10.1016/S0747-7171(08)80017-XzbMath0721.16001MaRDI QIDQ2640676

Lajos Rónyai

Publication date: 1990

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

zbMATH Keywords

algorithmsassociative algebrazero divisorsminimal idealsstructure constantscomputational problemsF-basis

Mathematics Subject Classification ID

Finite rings and finite-dimensional associative algebras (16P10) Parallel algorithms in computer science (68W10) Computational aspects of associative rings (general theory) (16Z05)

Related Items (36)

Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\) ⋮ On isomorphism testing of groups with normal Hall subgroups ⋮ Finding the radical of an algebra of linear transformations ⋮ Computing the Cassels–Tate pairing on the 3-Selmer group of an elliptic curve ⋮ Cryptographic algorithms on groups and algebras ⋮ Computing Cartan subalgebras of Lie algebras ⋮ An identification system based on the explicit isomorphism problem ⋮ Exact hierarchical reductions of dynamical models via linear transformations ⋮ Two-closure of rank \(3\) groups in polynomial time ⋮ Formations of finite groups in polynomial time: \(\mathfrak{F}\)-residuals and \(\mathfrak{F}\)-subnormality ⋮ Splitting full matrix algebras over algebraic number fields. ⋮ Computing the order of centralizers in linear groups ⋮ 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 ⋮ Efficient decomposition of associative algebras over finite fields ⋮ Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms ⋮ Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\) ⋮ Testing isomorphism of modules. ⋮ Effective descent for differential operators ⋮ Effective detection of nonsplit module extensions. ⋮ Unnamed Item ⋮ Average-case linear matrix factorization and reconstruction of low width algebraic branching programs ⋮ Computing Chevalley bases in small characteristics ⋮ Determinant Equivalence Test over Finite Fields and over Q ⋮ Testing Isomorphism of Lattices over CM-Orders ⋮ Explicit $n$-descent on elliptic curves III. Algorithms ⋮ From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces ⋮ Explicit isomorphisms of quaternion algebras over quadratic global fields ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures ⋮ Lie algebraic computation ⋮ Using Cartan subalgebras to calculate nilradicals and Levi subalgebras of Lie algebras ⋮ Finding the radical of matrix algebras using Fitting decompositions ⋮ A note on locality of algebras ⋮ Finding maximal orders in semisimple algebras over \(\mathbb{Q}\) ⋮ Decomposition of algebras over \(F_ q(X_ 1,\dots,X_ m)\)

Cites Work

• Isomorphism of graphs of bounded valence can be tested in polynomial time
• A Deterministic Algorithm for Factorizing Polynomials of Fq [X]
• Probabilistic Algorithms in Finite Fields
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Factoring Polynomials Over Large Finite Fields
• Introduction to Lie Algebras and Representation Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the structure of finite algebras