Computing isomorphisms between lattices
From MaRDI portal
Publication:5118858
DOI10.1090/MCOM/3543zbMATH Open1452.11134arXiv1806.08631OpenAlexW3010894375MaRDI QIDQ5118858FDOQ5118858
Authors: Tommy Hofmann, Henri Johnston 
Publication date: 27 August 2020
Published in: Mathematics of Computation (Search for Journal in Brave)
Abstract: Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left) Lambda-lattice X either computes a free basis of X over Lambda or shows that X is not free over Lambda. In the present article, we generalise this by showing that, under weaker hypotheses on A, there exists an algorithm that for two given Lambda-lattices X and Y either computes an isomorphism X -> Y or determines that X and Y are not isomorphic. The algorithm is implemented in Magma for A=Q[G], Lambda=Z[G] and Lambda-lattices X and Y contained in Q[G], where G is a finite group satisfying certain hypotheses. This is used to investigate the Galois module structure of rings of integers and ambiguous ideals of tamely ramified Galois extensions of Q with Galois group isomorphic to Q_8 x C_2, the direct product of the quaternion group of order 8 and the cyclic group of order 2.
Full work available at URL: https://arxiv.org/abs/1806.08631
Recommendations
Computational aspects of associative rings (general theory) (16Z05) Integral representations related to algebraic numbers; Galois module structure of rings of integers (11R33) Algebraic number theory computations (11Y40)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Title not available (Why is that?)
- Computing Hilbert Modular Forms over Fields with Nontrivial Class Group
- Title not available (Why is that?)
- Advanced Topics in Computional Number Theory
- Exact sequences and Galois module structure
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Fröhlich's conjecture for rings of integers of tame extensions
- On the square root of the inverse different
- Galois module structure of the square root of the inverse different in even degree tame extensions of number fields
- Projective modules over binary polyhedral groups.
- Title not available (Why is that?)
- Un anneau d'entiers stablement libre et non libre
- Normal Bases in Galois Extensions of Number Fields
- The Galois structure of the square root of the inverse different
- Title not available (Why is that?)
- Über die Hauptordnung der ganzen Elemente eines abelschen Zahlkörpers.
- The ring of integers of an abelian number field.
- Algorithmic Number Theory
- On extensions of lattices
- Title not available (Why is that?)
- Algorithmic enumeration of ideal classes for quaternion orders
- Recognition of division algebras.
- Computing in arithmetic groups with Voronoï's algorithm.
- Computing the character table of a finite group.
- Stably free rings of integers over \(\mathbb{Z}[H_8\times C_2]\)
- Computing associated orders and Galois generating elements of unit lattices
- An algorithm for the construction of a normal basis
- Title not available (Why is that?)
- Computations in relative algebraic \(K\)-groups.
- Computing generators of free modules over orders in group algebras.
- On normal integral bases of local fields
- Cancellation in totally definite quaternion algebras
- A note on cancellation in totally definite quaternion algebras
- Picard Groups and Refined Discrete Logarithms
- Some Problems of Galois Module Structure for Wild Extensions
- Euclidean Rings
- Nemo/Hecke
- On the computation of the HNF of a module over the ring of integers of a number field
- Normalbasis bei Körpern ohne höhere Verzweigung.
- Computing in quotients of rings of integers
- An algorithm for the principal ideal problem in indefinite quaternion algebras
- Computing generators of free modules over orders in group algebras. II.
- On Representations of Orders Over Dedekind Domains
- On the construction of class fields
Cited In (6)
- On the effective computation of isomorphisms between and GF
- Leopoldt-type theorems for non-abelian extensions of \(\mathbb{Q}\)
- On Computing Isomorphisms of Equation Orders
- Computation of lattice isomorphisms and the integral matrix similarity problem
- Computing generators of free modules over orders in group algebras. II.
- Title not available (Why is that?)
Uses Software
This page was built for publication: Computing isomorphisms between lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118858)
