Computing ideals of points
DOI10.1006/JSCO.2000.0411zbMATH Open0977.13011OpenAlexW1982662469MaRDI QIDQ1588025FDOQ1588025
Authors: John Abbott, Anna M. Bigatti, Martin Kreuzer, Lorenzo Robbiano 
Publication date: 11 March 2001
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.2000.0411
Recommendations
- scientific article; zbMATH DE number 806912
- Minimally generating ideals of points in polynomial time using linear algebra
- Computation of minimal generators of ideals of fat points
- Ideals of points in generic position: A polynomial algorithm for computing a minimal set of generators
- scientific article; zbMATH DE number 671732
Hilbert functionCoCoAfinite set of pointsalgorithm over the rationalsGröbner basisBuchberger-Möller algorithm
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Varieties defined by ring conditions (factorial, Cohen-Macaulay, seminormal) (14M05)
Cites Work
- Cayley-Bacharach Schemes and Their Canonical Modules
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Title not available (Why is that?)
- P-adic reconstruction of rational numbers
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Efficient rational number reconstruction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer algebra. EUROCAM '82, European Computer Algebra Conference, Marseille, France, 5-7 April 1982
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (29)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals
- Geometric characterization of data sets with unique reduced Gröbner bases
- A computational algebra approach to the reverse engineering of gene regulatory networks
- Small Gröbner fans of ideals of points
- Gröbner bases and generalized Padé approximation
- Vector space bases associated to vanishing ideals of points
- Title not available (Why is that?)
- Finite sets of \(d\)-planes in affine space
- The vanishing ideal of a finite set of points with multiplicity structures
- Some combinatorial applications of Gröbner bases
- A bivariate preprocessing paradigm for the Buchberger-Möller algorithm
- Separators of fat points in \(\mathbb P^n\).
- Multiplication matrices and ideals of projective dimension zero
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
- On the unique representation of very strong algebraic geometry codes
- Computing the state difference equations for discrete overdetermined linear \(m \operatorname{D}\) systems
- Ideals of curves given by points
- Stable border bases for ideals of points
- Fast amortized multi-point evaluation
- Approximate computation of zero-dimensional polynomial ideals
- A two-dimensional improvement for Farr-Gao algorithm
- On the Cohen-Macaulayness of the conormal module of an ideal
- Degröbnerization: a political manifesto
- The Big Mother of all Dualities: Möller Algorithm
- The FGLM problem and Möller's algorithm on zero-dimensional ideals
- Computing zero-dimensional schemes
- A short history of algebraic statistics
- Implicitization of hypersurfaces
Uses Software
This page was built for publication: Computing ideals of points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1588025)
