A modular algorithm to compute the generalized Hermite normal form for Z[x]-lattices
From MaRDI portal
Publication:504418
DOI10.1016/J.JSC.2016.12.005zbMATH Open1357.13028OpenAlexW2570033243MaRDI QIDQ504418FDOQ504418
Authors: Rui-Juan Jing, Chunming Yuan 
Publication date: 16 January 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2016.12.005
Recommendations
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\)
- Modular algorithm for reducing matrices to the Smith normal form
- A polynomial time algorithm for computing the HNF of a module over the integers of a number field
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- scientific article; zbMATH DE number 1254301
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- Using Algebraic Geometry
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- Modular algorithms for computing Gröbner bases.
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- Normal forms for general polynomial matrices
- Title not available (Why is that?)
- Fast computation of GCDs
- On lattice reduction for polynomial matrices
- Ideal basis and primary decompositions: case of two variables
- Polynomial division and its computational complexity
- A p-adic approach to the computation of Gröbner bases
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
Cited In (7)
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\)
- Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction (addenda and errata)
- Hermite and Smith normal form algorithms over Dedekind domains
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- A Formal Proof of the Computation of Hermite Normal Form in a General Setting
- An extension of the fpLLL library to Hermitian lattices
- Toric P-difference varieties
This page was built for publication: A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504418)
