Minimally generating ideals of points in polynomial time using linear algebra
algorithm[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis]minimal set of generators0-dimensional varietiesGaussian eliminationspoints in projective space
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Commutative rings and modules of finite generation or presentation; number of generators (13E15) Varieties defined by ring conditions (factorial, Cohen-Macaulay, seminormal) (14M05) Software, source code, etc. for problems pertaining to commutative algebra (13-04)
- Implicitization of a general union of parametric varieties
- scientific article; zbMATH DE number 671732 (Why is no real title available?)
- Minimally generating ideals of rational parametric curves in polynomial time
- Computing zero-dimensional schemes
- scientific article; zbMATH DE number 5349007 (Why is no real title available?)
- Combinatorial dimension theory of algebraic varieties
- Maximal rank and minimal generation of some parametric varieties.
- Algorithms for checking zero-dimensional complete intersections
- How to compute the Chow form of an unmixed polynomial ideal in single exponential time
- An algorithm for computing set-theoretic generators of an algebraic variety
- Computation of minimal generators of ideals of fat points
- Computing ideals of points
- On the unique representation of very strong algebraic geometry codes
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)
