Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
From MaRDI portal
Publication:5261424
Recommendations
Cites work
- scientific article; zbMATH DE number 5245181 (Why is no real title available?)
- scientific article; zbMATH DE number 967945 (Why is no real title available?)
- A numerical local dimension test for points on the solution set of a system of polynomial equations
- Algorithm 921: alphaCertified: certifying solutions to polynomial systems
- Algorithm 931
- Computing the multiplicity structure in solving polynomial systems
- Isosingular sets and deflation
- Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
- Newton's method with deflation for isolated singularities of polynomial systems
- The closedness subspace method for computing the multiplicity structure of a polynomial system
Cited in
(9)- A Numerical Survey of the Floors of Various Hilbert Fundamental Domains
- Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme
- Binomiality testing and computing sparse polynomials via witness sets
- Computing zero-dimensional schemes
- Numerical elimination and moduli space of vacua
- Learning algebraic varieties from samples
- Probabilistic saturations and Alt's problem
- Eliminating dual spaces
- scientific article; zbMATH DE number 5654498 (Why is no real title available?)
This page was built for publication: Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261424)