Fast ideal arithmetic via lazy localization
The author proposes a new, compact and highly readable representation for ideals of any order in a number field. The idea is the following. Any nonzero ideal contains some positive integer \(N\). Represent the ideal locally at all primes of \(\mathbb{Z}\) dividing \(N\). To avoid factorization problems in practice, instead of the set of prime divisors of \(N\) a coprime base \(P\) for \(N\) is used that is a pairwise coprime set of positive integers generating a semigroup that contains \(N\). This representation is compatible with ideal arithmetic: all usual ideal operations are local. It turns out that this representation is generally faster than the usual representations in the \(\mathbb{Z}\) basis or the two-element representation. The paper details the algorithms for this representation and for the basic operations. For the entire collection see [Zbl 0852.00023].
- Algorithmic theory of arithmetic rings, Prüfer rings and Dedekind rings. (Théorie algorithmique des anneaux arithmétiques, des anneaux de Prüfer et des anneaux de Dedekind.)
- Shorter compact representations in real quadratic fields
- Reducing ideal arithmetic to linear algebra problems
- A new computational approach to ideal theory in number fields
- Sparse Representation for Cyclotomic Fields
- Dynamical Gröbner bases over Dedekind rings
This page was built for publication: Fast ideal arithmetic via lazy localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375594)
