Sparse trace tests
From MaRDI portal
Abstract: We establish how the coefficients of a sparse polynomial system influence the sum (or the trace) of its zeros. As an application, we develop numerical tests for verifying whether a set of solutions to a sparse system is complete. These algorithms extend the classical trace test in numerical algebraic geometry. Our results rely on both the analysis of the structure of sparse resultants as well as an extension of Esterov's results on monodromy groups of sparse systems.
Cites work
- scientific article; zbMATH DE number 953044 (Why is no real title available?)
- scientific article; zbMATH DE number 960150 (Why is no real title available?)
- A Poisson formula for the sparse resultant
- A convex geometric approach to counting the roots of a polynomial system
- A package for computations with sparse resultants
- A theorem on the Poincaré group of an algebraic hypersurface
- Computing mixed volume and all mixed cells in quermassintegral time
- Galois groups of enumerative problems
- Galois theory for general systems of polynomial equations
- General witness sets for numerical algebraic geometry
- Introduction to numerical algebraic geometry
- Multiprojective witness sets and a trace test
- On the Newton polytope of the resultant
- Rational formulas for traces in zero-dimensional algebras
- Real enumerative geometry and effective algebraic equivalence
- Solving decomposable sparse systems
- Sparse polynomial equations and other enumerative problems whose Galois groups are wreath products
- Sparse resultant under vanishing coefficients
- Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
- Toric varieties
- Trace test
Cited in
(4)
This page was built for publication: Sparse trace tests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133451)
