DeepAI AI Chat
Log In Sign Up

Sparse trace tests

by   Taylor Brysiewicz, et al.

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.


page 1

page 2

page 3

page 4


Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals

Diekert, Matiyasevich and Muscholl proved that the existential first-ord...

Decomposable sparse polynomial systems

The Macaulay2 package DecomposableSparseSystems implements methods for s...

Numerically validating the completeness of the real solution set of a system of polynomial equations

Computing the real solutions to a system of polynomial equations is a ch...

On Generalizing Trace Minimization

Ky Fan's trace minimization principle is extended along the line of the ...

Minimal codewords in Norm-Trace codes

In this paper, we consider the affine variety codes obtained evaluating ...

Selection of Sparse Sets of Influence for Meshless Finite Difference Methods

We suggest an efficient algorithm for the selection of sparse subsets of...

Inversion of trace formulas for a Sturm-Liouville operator

This paper revisits the classical problem "Can we hear the density of a ...