Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)

DOI10.1007/BF01271370zbMath0792.16020OpenAlexW47614929MaRDI QIDQ1312180

Gábor Ivanyos, Lajos Rónyai

Publication date: 7 August 1994

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01271370

zbMATH Keywords

group ringsirreducible representationssemisimple algebraalgebraic number fieldhereditary ordersmaximal orderfactoring polynomials over finite fieldspolynomial time ff-algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Ordinary representations and characters (20C15) Number-theoretic algorithms; complexity (11Y16) Group rings of finite groups and their modules (group-theoretic aspects) (20C05) Algebraic number theory computations (11Y40) Computational aspects of associative rings (general theory) (16Z05) Separable algebras (e.g., quaternion algebras, Azumaya algebras, etc.) (16H05) Other algebras and orders, and their zeta and (L)-functions (11R54)

Related Items (21)

Computation of lattice isomorphisms and the integral matrix similarity problem ⋮ Improved torsion-point attacks on SIDH variants ⋮ Computing the Cassels–Tate pairing on the 3-Selmer group of an elliptic curve ⋮ Lattice basis reduction for indefinite forms and an application ⋮ Orders of quaternion algebras with involution ⋮ Splitting quaternion algebras over quadratic number fields ⋮ On the computation of overorders ⋮ Splitting full matrix algebras over algebraic number fields. ⋮ Efficient decomposition of separable algebras. ⋮ Lattices from maximal orders into quaternion algebras ⋮ Trivializing a central simple algebra of degree 4 over the rational numbers. ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ Identifying the Matrix Ring: Algorithms for Quaternion Algebras and Quadratic Forms ⋮ Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\) ⋮ A Lie algebra method for rational parametrization of Severi-Brauer surfaces. ⋮ Recognition of division algebras. ⋮ Fractional non-norm elements for division algebras, and an application to cyclic learning with errors ⋮ Algebraic construction of lattices via maximal quaternion orders ⋮ Solvability of norm equations over cyclic number fields of prime degree ⋮ Explicit $n$-descent on elliptic curves III. Algorithms ⋮ Explicit isomorphisms of quaternion algebras over quadratic global fields

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\)
• Computing the structure of finite algebras
• Two Remarks About Hereditary Orders
• Hereditary Orders

This page was built for publication: Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)