Modular algorithms for computing Gröbner bases.

DOI10.1016/S0747-7171(02)00140-2zbMath1046.13018OpenAlexW2061715373MaRDI QIDQ1401905

Publication date: 19 August 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(02)00140-2

zbMATH Keywords

modular algorithms unlucky primes time improvements

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 (48)

Computing integral bases via localization and Hensel lifting ⋮ The solution of the \(1:-3\) resonant center problem in the quadratic case ⋮ The center problem and composition condition for Abel differential equations ⋮ Bistability and oscillations in chemical reaction networks ⋮ Local to Global Algorithms for the Gorenstein Adjoint Ideal of a Curve ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ Gröbner bases of symmetric ideals ⋮ A smoothness test for higher codimensions ⋮ Modular techniques for noncommutative Gröbner bases ⋮ The center problem for a \({1:-4}\) resonant quadratic system ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ Digital collections of examples in mathematical sciences ⋮ A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs) ⋮ Modular computations of standard bases for subalgebras ⋮ \textsc{Rings}: an efficient Java/Scala library for polynomial rings ⋮ Methodologies of Symbolic Computation ⋮ The center problem for a \(2:-3\) resonant cubic Lotka-Volterra system ⋮ Parallelization of modular algorithms ⋮ Standard bases over Euclidean domains ⋮ Efficient Gröbner bases computation over principal ideal rings ⋮ An approach to solving systems of polynomials via modular arithmetics with applications ⋮ Matrix-F5 algorithms over finite-precision complete discrete valuation fields ⋮ Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings ⋮ Qualitative studies of some biochemical models ⋮ Groebner basis methods for stationary solutions of a low-dimensional model for a shear flow ⋮ Distortion varieties ⋮ A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x\)-lattices] ⋮ Gröbner bases for families of affine or projective schemes ⋮ Isochronicity and linearizability of a planar cubic system ⋮ Linearizability and critical period bifurcations of a generalized Riccati system ⋮ Usage of modular techniques for efficient computation of ideal operations ⋮ On the modular computation of Gröbner bases with integer coefficients ⋮ Integrability conditions for Lotka-Volterra planar complex quintic systems ⋮ Parallel modular computation of Gröbner and involutive bases ⋮ Efficient Algorithms for Computing Nœther Normalization ⋮ Computation of highly ramified coverings ⋮ Giac and GeoGebra – Improved Gröbner Basis Computations ⋮ Bad Primes in Computational Algebraic Geometry ⋮ Centers and Limit Cycles of a Generalized Cubic Riccati System ⋮ Computing and using minimal polynomials ⋮ Modular Algorithms for Computing a Generating Set of the Syzygy Module ⋮ Calculation of first integrals of a two-dimensional ODE system near a degenerate stationary point by computer algebra tools ⋮ Ideals Modulo a Prime ⋮ The use of bad primes in rational reconstruction ⋮ Using semicontinuity for standard bases computations ⋮ AN APPLICATION OF REGULAR CHAIN THEORY TO THE STUDY OF LIMIT CYCLES ⋮ Isochronicity and linearizability of planar polynomial Hamiltonian systems ⋮ Probabilistic Saturations and Alt’s Problem

Uses Software

Cites Work

This page was built for publication: Modular algorithms for computing Gröbner bases.