A p-adic approach to the computation of Gröbner bases
From MaRDI portal
Publication:1118653
DOI10.1016/S0747-7171(88)80049-XzbMath0669.13009MaRDI QIDQ1118653
Publication date: 1988
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)
Related Items (19)
Complexity results for triangular sets ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ Arithmetic of Shimura varieties. Abstracts from the workshop held January 29 -- February 4, 2023 ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ Gröbner bases of reaction networks with intermediate species ⋮ A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs) ⋮ Modular algorithms for computing Gröbner bases. ⋮ Parallelization of modular algorithms ⋮ Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm ⋮ An approach to solving systems of polynomials via modular arithmetics with applications ⋮ Matrix-F5 algorithms over finite-precision complete discrete valuation fields ⋮ A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x\)-lattices] ⋮ A hybrid symbolic-numerical approach to the center-focus problem ⋮ Usage of modular techniques for efficient computation of ideal operations ⋮ On lucky ideals for Gröbner basis computations ⋮ Computing and using minimal polynomials ⋮ Floating point Gröbner bases. ⋮ Ideals Modulo a Prime ⋮ Automated resolution of singularities for hypersurfaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mapping integers and Hensel codes onto Farey fractions
- Realization of the Mathieu groups \(M_{11}\) and \(M_{12}\) as Galois groups over \({\mathbb Q})\).
- New constructive methods in classical ideal theory
- Théorème de division et stabilité en géométrie analytique locale
- On Hensel factorization. I
- Some comments on the modular approach to Gröbner-bases
- On improving approximate results of Buchberger's algorithm by Newton's method
- Algorithm 628
- Multivariate Polynomial Factorization
- Factoring Multivariate Polynomials Over the Integers
- An Improved Multivariate Polynomial Factoring Algorithm
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
This page was built for publication: A p-adic approach to the computation of Gröbner bases
