Computing the ideal class monoid of an order
From MaRDI portal
Abstract: There are well known algorithms to compute the class group of the maximal order of a number field and the group of invertible ideal classes of a non-maximal order . In this paper we explain how to compute also the isomorphism classes of non-invertible ideals of an order in a finite product of number fields . In particular we also extend the above-mentioned algorithms to this more general setting. Moreover, we generalize a theorem of Latimer and MacDuffee providing a bijection between the conjugacy classes of integral matrices with given minimal and characteristic polynomials and the isomorphism classes of lattices in certain -algebras, which under certain assumptions can be explicitly described in terms of ideal classes.
Recommendations
Cites work
- A survey of integral representation theory
- Approximating rings of integers in number fields
- Computing residue class rings and Picard groups of orders
- Dedekind-like behavior of rings with 2-generated ideals
- Elementary Divisors and Modules
- scientific article; zbMATH DE number 429519 (Why is no real title available?)
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 5532104 (Why is no real title available?)
- scientific article; zbMATH DE number 3699180 (Why is no real title available?)
- scientific article; zbMATH DE number 1952949 (Why is no real title available?)
- On a Theorem of Latimer and Macduffee
- On the computation of overorders
- On the theory of orders, in particular on the semigroup of ideal classes and genera of an order in an algebraic number field
- On the ubiquity of Gorenstein rings
- Relations among discriminant, different, and conductor of an order
- The class semigroup of orders in number fields
- The Magma algebra system. I: The user language
Cited in
(28)- A result concerning classes of matrices
- On the computation of the endomorphism rings of abelian surfaces
- On the Brauer group of bielliptic surfaces (with an appendix by Jonas Bergström and Sofia Tirabassi)
- Computing residue class rings and Picard groups of orders
- Conjugacy Classes and Class Number
- Computing ideal classes representatives in quaternion algebras
- A new algorithm for computing idempotents of ℛ-trivial monoids
- Computation of lattice isomorphisms and the integral matrix similarity problem
- Computing base extensions of ordinary abelian varieties over finite fields
- On the computation of overorders
- Computing square-free polarized abelian varieties over finite fields
- Algorithmic Number Theory
- Extensions and torsors for finite group schemes
- Finite subgroups of automorphisms of K3 surfaces
- Isomorphism classes of Drinfeld modules over finite fields
- Canonical modules and class groups of Rees-like algebras
- Ideal classes of orders in quaternion algebras
- On the similarity over the ring of integers of certain nilpotent matrices of maximal rank
- Cohen-Macaulay type of orders, generators and ideal classes
- Chow groups of one-dimensional Noetherian domains
- Class number for pseudo-Anosovs
- On ideal class groups of totally degenerate number rings
- Abelian varieties with real multiplication: classification and isogeny classes over finite fields
- Local isomorphism classes of fractional ideals of orders in étale algebras
- Infinite families of standard Cappell-Shaneson homotopy 4-spheres
- Abelian varieties over finite fields and their groups of rational points
- Modules over orders, conjugacy classes of integral matrices, and abelian varieties over finite fields
- Labeling abelian varieties over finite fields
This page was built for publication: Computing the ideal class monoid of an order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304706)