Computation of Macaulay constants and degree bounds for Gröbner bases

DOI10.1016/j.jsc.2021.11.004OpenAlexW3216547704MaRDI QIDQ2066954

Amir Hashemi, Hossein Parnian, Werner M. Seiler

Publication date: 17 January 2022

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2021.11.004

zbMATH Keywords

Gröbner basesHilbert seriespolynomial idealscone decompositionsdegree upper boundsMacaulay constants

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40)

Uses Software

• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computation of Hilbert-Poincaré series
• A Pommaret bases approach to the degree of a polynomial ideal
• The complexity of the word problems for commutative semigroups and polynomial ideals
• On the affine Bezout inequality
• Dimension-dependent bounds for Gröbner bases of polynomial ideals
• Degree upper bounds for involutive bases
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• The Structure of Polynomial Ideals and Gröbner Bases
• A Course in Commutative Algebra
• A Singular Introduction to Commutative Algebra
• Dimension-Dependent Upper Bounds for Gröbner Bases
• Ideals, Varieties, and Algorithms

This page was built for publication: Computation of Macaulay constants and degree bounds for Gröbner bases