Computing ideals of points
\textit{H. M. Möller} and \textit{B. Buchberger} [Computer algebra, EUROCAM '82, Conf. Marseille/France 1982, Lect. Notes Comput. Sci. 144, 24-31 (1982; Zbl 0549.68026)] gave an algorithm to compute generators of the defining ideal of a finite set of points in affine space. While this algorithm is very efficient over finite fields, one may run into the problem of very large coefficients when performing this algorithm over the rationals. The first main result in the article under review is a modular version of the Buchberger-Möller algorithm to deal with this difficulty. Next, the authors consider the problem of determining generators for the homogeneous ideal of a finite set of points in projective space. This has been considered previously by \textit{M. G. Marinari, H. M. Möller}, and \textit{T. Mora} [Appl. Algebra Eng. Commun. Comput. 4, No. 2, 103-145 (1993; Zbl 0785.13009)], and by \textit{F. Cioffi} [Ric. Mat. 48, No. 1, 55-63 (1999; Zbl 0982.13015)]. For this problem, a stopping criterion is a difficulty, since the ideal is now one-dimensional instead of zero-dimensional. The authors show that a lemma (lemma 12.1) in the cited article by Marinari et al. is incorrect, and then go on to use properties of the Hilbert function to derive a stopping criterion. Finally, the authors consider the complexity of their algorithms and give examples of their algorithms implemented in CoCoA.
- 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
- Cayley-Bacharach Schemes and Their Canonical Modules
- Computer algebra. EUROCAM '82, European Computer Algebra Conference, Marseille, France, 5-7 April 1982
- Efficient rational number reconstruction
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- scientific article; zbMATH DE number 4214184 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 1163421 (Why is no real title available?)
- scientific article; zbMATH DE number 1163422 (Why is no real title available?)
- scientific article; zbMATH DE number 1163423 (Why is no real title available?)
- scientific article; zbMATH DE number 806912 (Why is no real title available?)
- P-adic reconstruction of rational numbers
- A two-dimensional improvement for Farr-Gao algorithm
- Multiplication matrices and ideals of projective dimension zero
- Geometric characterization of data sets with unique reduced Gröbner bases
- Degröbnerization: a political manifesto
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals
- A computational algebra approach to the reverse engineering of gene regulatory networks
- Fast amortized multi-point evaluation
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- On the Cohen-Macaulayness of the conormal module of an ideal
- 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 zero-dimensional schemes
- Vector space bases associated to vanishing ideals of points
- The vanishing ideal of a finite set of points with multiplicity structures
- Some combinatorial applications of Gröbner bases
- Small Gröbner fans of ideals of points
- The FGLM problem and Möller's algorithm on zero-dimensional ideals
- scientific article; zbMATH DE number 939805 (Why is no real title available?)
- The Big Mother of all Dualities: Möller Algorithm
- scientific article; zbMATH DE number 806912 (Why is no real title available?)
- Implicitization of hypersurfaces
- Ideals of curves given by points
- Gröbner bases and generalized Padé approximation
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Separators of fat points in P^n.
- Approximate computation of zero-dimensional polynomial ideals
- Discovery of exact equations via computing the Gröbner basis
- A short history of algebraic statistics
- Finite sets of d-planes in affine space
- Computing the state difference equations for discrete overdetermined linear \(m \operatorname{D}\) systems
- A bivariate preprocessing paradigm for the Buchberger-Möller algorithm
- Stable border bases for ideals of points
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)
