Computation of lattice isomorphisms and the integral matrix similarity problem
From MaRDI portal
Publication:5041469
DOI10.1017/fms.2022.74OpenAlexW4312741209MaRDI QIDQ5041469
Tommy Hofmann, Henri Johnston, Werner Bley
Publication date: 13 October 2022
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.03526
Linear algebraic groups over global fields and their integers (20G30) Algebraic number theory computations (11Y40) Integral representations related to algebraic numbers; Galois module structure of rings of integers (11R33) Computational aspects of associative rings (general theory) (16Z05)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Splitting full matrix algebras over algebraic number fields.
- Topics in computational algebraic number theory
- Computing associated orders and Galois generating elements of unit lattices
- Recognition of division algebras.
- Computing generators of free modules over orders in group algebras.
- Conjugacy problem for sets of integral matrices
- A note on the local-global principle for similarity of matrices
- The similarity problem for 3x3 integer matrices
- Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
- The Magma algebra system. I: The user language
- An algorithmic version of the theorem by Latimer and MacDuffee for 2\({\times}\)2 integral matrices
- On the computation of the HNF of a module over the ring of integers of a number field
- Discrete logarithms: The past and the future
- Subexponential time relations in the class group of large degree number fields
- An algorithm for the principal ideal problem in indefinite quaternion algebras
- Subexponential class group and unit group computation in large degree number fields
- Corrigendum: Algorithmic Enumeration of Ideal Classes for Quaternion Orders
- Computations in Relative Algebraic K-Groups
- Computing generators of free modules over orders in group algebras II
- Computing the ideal class monoid of an order
- Crystallographic Algorithms and Tables
- Continued fractions and the conjugacy problem in SL2; (Z)
- Algorithms in Algebraic Number Theory
- A Rigorous Time Bound for Factoring Integers
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Advanced Topics in Computional Number Theory
- Computing isomorphisms between lattices
- Nemo/Hecke
- The conjugacy problem in GL (n,Z)
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- Computing Hilbert Modular Forms over Fields with Nontrivial Class Group
- Picard Groups and Refined Discrete Logarithms
- Algorithmic Number Theory
- On the construction of class fields
