Dimension-dependent bounds for Gröbner bases of polynomial ideals
From MaRDI portal
Publication:1930154
DOI10.1016/j.jsc.2011.12.018zbMath1258.13032OpenAlexW2025513431MaRDI QIDQ1930154
Stephan Ritscher, Ernst W. Mayr
Publication date: 10 January 2013
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.018
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Dimension theory, depth, related commutative rings (catenary, etc.) (13C15) Polynomials and finite commutative rings (13M10)
Related Items
Unnamed Item, Complexity of Membership Problems of Different Types of Polynomial Ideals, A Pommaret bases approach to the degree of a polynomial ideal, On probabilistic algorithm for solving almost all instances of the set partition problem, Kac-Rice formulas and the number of solutions of parametrized systems of polynomial equations, Digital collections of examples in mathematical sciences, Methodologies of Symbolic Computation, Bounds on degrees of birational maps with arithmetically Cohen-Macaulay graphs, Dimension and depth dependent upper bounds in polynomial ideal theory, Degree upper bounds for involutive bases, Need Polynomial Systems Be Doubly-Exponential?, Cylindrical algebraic decomposition with equational constraints, The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree, Degree bounds for Gröbner bases of modules, Computation of Macaulay constants and degree bounds for Gröbner bases, An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
