Hilbert functions and the Buchberger algorithm
DOI10.1006/JSCO.1996.0056zbMATH Open0922.13019OpenAlexW1980368752MaRDI QIDQ674750FDOQ674750
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
[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
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)
Cited In (30)
- Deterministic genericity for polynomial ideals
- Usage of modular techniques for efficient computation of ideal operations
- STANDARD BASES OVER RINGS
- Computing the radical of an ideal in positive characteristic
- Axioms for a theory of signature bases
- Lattice polly cracker cryptosystems
- Minimally generating ideals of rational parametric curves in polynomial time
- An Hilbert-driven strategy for signature-based Gröbner basis algorithms
- A new Gröbner basis conversion method based on stabilization techniques
- Computing Gröbner Bases within Linear Algebra
- On the walk
- Modular algorithms for computing Gröbner bases.
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- Efficient Groebner walk conversion for implicitization of geometric objects
- Probabilistic Saturations and Alt’s Problem
- 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 \(\delta \)-regularity. II: Structure analysis of polynomial modules with Pommaret bases
- On the complexity of computing Gröbner bases for weighted homogeneous systems
- Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\)
- Computing inhomogeneous Gröbner bases
- A new class of term orders for elimination
- Signature-based algorithm under non-compatible term orders and its application to change of ordering
- Parametric FGLM algorithm
- On the computation of Gröbner bases for matrix-weighted homogeneous systems
- A fast algorithm for Gröbner basis conversion and its applications
- Improved Computation of Involutive Bases
Uses Software
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)
