Enhancing the Extended Hensel Construction by Using Gröbner Bases

DOI10.1007/978-3-319-45641-6_29zbMath1453.13073OpenAlexW2510701654MaRDI QIDQ2830021

Tateaki Sasaki, Daiju Inaba

Publication date: 9 November 2016

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45641-6_29

zbMATH Keywords

Gröbner basissyzygyextended Hensel constructionsingular leading coefficientsparse multivariate polynomial

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials, factorization in commutative rings (13P05)

Related Items (4)

On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation ⋮ A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs) ⋮ A new algorithm for computing the extended Hensel construction of multivariate polynomials ⋮ On the extended Hensel construction and its application to the computation of real limit points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving multivariate algebraic equation by Hensel construction
• A study of Hensel series in general case
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Factoring Multivariate Polynomials Over the Integers
• An Improved Multivariate Polynomial Factoring Algorithm
• Hensel construction of F(x, u ₁ , ..., x _l ) l ≥ 2 at a singular point and its applications
• Algorithms for the non-monic case of the sparse modular GCD algorithm
• Factorization of multivariate polynomials by extended Hensel construction

This page was built for publication: Enhancing the Extended Hensel Construction by Using Gröbner Bases