Computing zero-dimensional schemes
From MaRDI portal
Publication:2456531
DOI10.1016/J.JSC.2004.09.001zbMATH Open1120.13027OpenAlexW1982098398MaRDI QIDQ2456531FDOQ2456531
Authors: John Abbott, Martin Kreuzer, Lorenzo Robbiano 
Publication date: 19 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2004.09.001
Recommendations
- Zero-dimensional schemes in the plane
- Approximate computation of zero-dimensional polynomial ideals
- Computing zeta functions of arithmetic schemes
- Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
- Computing zero-dimensional tropical varieties via projections
- scientific article; zbMATH DE number 4212207
- Algebraic complexity of computing polynomial zeros
- scientific article; zbMATH DE number 4055478
- Computing the primary decomposition of zero-dimensional ideals
- Computational approaches for zero forcing and related problems
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- Title not available (Why is that?)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing toric ideals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Families of estimable terms
- Computing ideals of points
- On the Canonical Module of A 0-Dimensional Scheme
- Title not available (Why is that?)
- Minimally generating ideals of points in polynomial time using linear algebra
- Computation of minimal generators of ideals of fat points
Cited In (10)
- Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
- Using semicontinuity for standard bases computations
- Small Gröbner fans of ideals of points
- Finite sets of \(d\)-planes in affine space
- Testing zero-dimensionality of varieties at a point
- Efficient algorithms for finite \(\mathbb{Z}\)-algebras
- Multiplication matrices and ideals of projective dimension zero
- The variety of bad zero-schemes
- The FGLM problem and Möller's algorithm on zero-dimensional ideals
- Implicitization of hypersurfaces
Uses Software
This page was built for publication: Computing zero-dimensional schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456531)
