Finding sparse systems of parameters

DOI10.1016/0022-4049(94)90029-9zbMath0807.13012arXivalg-geom/9305010OpenAlexW2078281187MaRDI QIDQ1328769

David Eisenbud, Bernd Sturmfels

Publication date: 7 August 1994

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/alg-geom/9305010

zbMATH Keywords

Gröbner basespolynomial idealsystems of parametersNoether complexity

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Noether normalization guided by monomial cone decompositions, A Pommaret bases approach to the degree of a polynomial ideal, Binomial ideals, Sparse systems of parameters for determinantal varieties, Deterministic genericity for polynomial ideals, Recursive structures in involutive bases theory, Effective Genericity, δ-Regularity and Strong Noether Position, Bernstein's theorem in affine space, Monodromy and the Tate conjecture: Picard numbers and Mordell-Weil ranks in families., Direct methods for primary decomposition, Gröbner bases, invariant theory and equivariant dynamics

Cites Work

• How to compute the Chow form of an unmixed polynomial ideal in single exponential time
• On the computation of Hilbert-Poincaré series
• The membership problem for unmixed polynomial ideals is solvable in single exponential time
• Chow polytopes and general resultants
• Computation of Hilbert functions
• Direct methods for primary decomposition
• Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item