Combinatorial excess intersection
From MaRDI portal
Abstract: We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical algebraic geometry.
Recommendations
- A saturation algorithm for homogeneous binomial ideals
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- A special homotopy continuation method for a class of polynomial systems
- A polyhedral homotopy algorithm for real zeros
- Multiplication matrices and ideals of projective dimension zero
- Homotopies for connected components of algebraic sets with application to computing critical sets
- Certified numerical homotopy tracking
- Mixed cell computation in HOM4ps
- scientific article; zbMATH DE number 2084924
- On approximate linearized triangular decompositions
Cites work
- scientific article; zbMATH DE number 1027930 (Why is no real title available?)
- Algebraic geometric comparison of probability distributions
- Algorithm 795
- Chern numbers of smooth varieties via homotopy continuation and intersection theory
- Computing intersection numbers of Chern classes
- How to integrate a polynomial over a simplex
- Lectures on Polytopes
- Segre classes as integrals over polytopes
- Segre classes on smooth projective toric varieties
- Software for numerical algebraic geometry: a paradigm and progress towards its implementation
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
This page was built for publication: Combinatorial excess intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480696)