A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices

DOI10.1016/j.jsc.2016.12.005zbMath1357.13028OpenAlexW2570033243MaRDI QIDQ504418

Rui-Juan Jing, Chun-Ming 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

zbMATH Keywords

generalized Hermite normal formHensel liftingmodular algorithmreduced Gröbner bases

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (1)

Toric P-difference varieties

Cites Work

• Unnamed Item
• Polynomial division and its computational complexity
• Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
• A p-adic approach to the computation of Gröbner bases
• On lattice reduction for polynomial matrices
• Modular algorithms for computing Gröbner bases.
• Ideal basis and primary decompositions: case of two variables
• Normal forms for general polynomial matrices
• Hermite Normal Form Computation Using Modulo Determinant Arithmetic
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Fast computation of GCDs
• Using Algebraic Geometry

This page was built for publication: A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices