Minimally generating ideals of points in polynomial time using linear algebra
0-dimensional varietiesalgorithmGaussian eliminationsGröbner basisminimal set of generatorspoints in projective space
Software, source code, etc. for problems pertaining to commutative algebra (13-04) Commutative rings and modules of finite generation or presentation; number of generators (13E15) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Varieties defined by ring conditions (factorial, Cohen-Macaulay, seminormal) (14M05) Symbolic computation and algebraic computation (68W30)
Given \(s\) distinct points in the \(n\)-dimensional projective space, the author presents an algorithm for computing a minimal set of generators of the ideal \(I\) of the given points. The complexity of the algorithm shown is polynomial in the number of points \(s\) and the dimension of the projective space \(n\). First, generators of \(I\) are computed by an interpolating method based on linear functionals. By means of some matrix computations, a Gröbner basis \(S\) for \(I\) is obtained and, afterwards, a particular subset of \(S\) is reduced to a minimal set of generators of the ideal \(I\). This is done essentially by iterated Gaussian eliminations.
- Ideals of points in generic position: A polynomial algorithm for computing a minimal set of generators
- Maximal rank and minimal generation of some parametric varieties.
- Minimally generating ideals of rational parametric curves in polynomial time
- Computing ideals of points
- Algorithms for checking zero-dimensional complete intersections
- On the unique representation of very strong algebraic geometry codes
- Computing zero-dimensional schemes
- Computation of minimal generators of ideals of fat points
- scientific article; zbMATH DE number 5349007 (Why is no real title available?)
- scientific article; zbMATH DE number 671732 (Why is no real title available?)
- An algorithm for computing set-theoretic generators of an algebraic variety
- Implicitization of a general union of parametric varieties
- Cohen-Macaulay, Gorenstein and complete intersection conditions by marked bases
- How to compute the Chow form of an unmixed polynomial ideal in single exponential time
- Combinatorial dimension theory of algebraic varieties
This page was built for publication: Minimally generating ideals of points in polynomial time using linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1576994)
