The Structure of Polynomial Ideals and Gröbner Bases
From MaRDI portal
Publication:3474891
DOI10.1137/0219053zbMath0697.68051OpenAlexW2017483928WikidataQ56391718 ScholiaQ56391718MaRDI QIDQ3474891
Publication date: 1990
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bbcd6579c395e9310f1d5b733746ce6deada4fd2
Symbolic computation and algebraic computation (68W30) Combinatorial aspects of partitions of integers (05A17)
Related Items
Random sampling in computational algebra: Helly numbers and violator spaces, Buchberger-Weispfenning theory for effective associative rings, On polynomial ideals, their complexity, and applications, The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups, Unnamed Item, Efficient Groebner walk conversion for implicitization of geometric objects, Complexity of Membership Problems of Different Types of Polynomial Ideals, Generalized typical dimension of a graded module, A decision method for the integrability of differential-algebraic Pfaffian systems, Learning a performance metric of Buchberger's algorithm, Sums-of-squares formulas over algebraically closed fields, The topology of equivariant Hilbert schemes, Some properties of coefficients of the Kolchin dimension polynomial, Algorithms for computing greatest common divisors of parametric multivariate polynomials, Gröbner Bases in D-Modules: Application to Bernstein-Sato Polynomials, Difference Galois groups under specialization, A new class of term orders for elimination, An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, Groebner basis methods for multichannel sampling with unknown offsets, A bound for a typical differential dimension of systems of linear differential equations, Distinct distances on curves via rigidity, An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups, Noncyclic covers of knot complements, Gröbner bases over fields with valuations, Point-curve incidences in the complex plane, Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients, Dimension and depth dependent upper bounds in polynomial ideal theory, Degree upper bounds for involutive bases, On the finiteness theorem for rational maps on a variety of general type, Finding roots of a multivariate polynomial in a linear subspace, Reduction Mod p of Standard Bases, Inequalities for Hilbert functions and primary decompositions, Complexity of a standard basis of a $D$-module, Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal, Degree bounds for Gröbner bases in algebras of solvable type, Degree bounds for Gröbner bases of modules, Computation of Macaulay constants and degree bounds for Gröbner bases, Explicit polynomial bounds on prime ideals in polynomial rings over fields, Bounds on the torsion subgroup schemes of Néron-Severi group schemes, A fast algorithm for Gröbner basis conversion and its applications, A combinatorial complexity of Gröbner bases, The degree of a tropical basis, Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups., Complementary decompositions of monomial ideals and involutive bases, Hrushovski's algorithm for computing the Galois group of a linear differential equation, Maximal directional operators along algebraic varieties, On the complexity of the \(F_5\) Gröbner basis algorithm, Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem, Multilevel polynomial partitions and simplified range searching
