Hilbert functions and the Buchberger algorithm

DOI10.1006/JSCO.1996.0056MaRDI QIDQ674750zbMATH OpenOpenAlexFDO

Authors Carlo Traverso

Publication date 14 October 1999

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

Full work available at URL https://doi.org/10.1006/jsco.1996.0056

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis][https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Hilbert-Poincar%EF%BF%BD%EF%BF%BD+series&go=Go Hilbert-Poincar�� series]Buchberger algorithm

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) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Recommendations

• Computation of Hilbert functions
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points

Cited in

(35)

• Deterministic genericity for polynomial ideals
• Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
• Usage of modular techniques for efficient computation of ideal operations
• Computing the radical of an ideal in positive characteristic
• Computation of Hilbert functions
• Axioms for a theory of signature bases
• Lattice polly cracker cryptosystems
• Minimally generating ideals of rational parametric curves in polynomial time
• A new Gröbner basis conversion method based on stabilization techniques
• An Hilbert-driven strategy for signature-based Gröbner basis algorithms
• On the walk
• Computing Gröbner Bases within Linear Algebra
• Modular algorithms for computing Gröbner bases.
• Triangular sets for solving polynomial systems: a comparative implementation of four methods
• Efficient Groebner walk conversion for implicitization of geometric objects
• \textsc{Rings}: an efficient Java/Scala library for polynomial rings
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Computing syzygies over \(V [X_1, \ldots, X_k]\), \(V\) a valuation domain
• Computing Gröbner fans
• Implicitization of a general union of parametric varieties
• A new algorithm for Gröbner bases conversion
• A combinatorial approach to involution and -regularity. II: Structure analysis of polynomial modules with Pommaret bases
• Computing Gröbner bases of pure binomial ideals via submodules of Z^n
• Improved computation of involutive bases
• scientific article; zbMATH DE number 3918515 (Why is no real title available?)
• On the complexity of computing Gröbner bases for weighted homogeneous systems
• Computing inhomogeneous Gröbner bases
• Degree of base elimination polynomials and resultants
• A new class of term orders for elimination
• Standard bases over rings
• Parametric FGLM algorithm
• Signature-based algorithm under non-compatible term orders and its application to change of ordering
• Probabilistic saturations and Alt's problem
• On the computation of Gröbner bases for matrix-weighted homogeneous systems
• A fast algorithm for Gröbner basis conversion and its applications

Describes a project that uses

Uses Software

• SINGULAR

This page was built for publication: Hilbert functions and the Buchberger algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674750)