Tropical varieties for exponential sums

@article{Ergr2019TropicalVF,
  title={Tropical varieties for exponential sums},
  author={Alperen Ali Erg{\"u}r and Grigoris Paouris and J. Maurice Rojas},
  journal={Mathematische Annalen},
  year={2019},
  pages={1-20}
}
We study the complexity of approximating complex zero sets of certain n-variate exponential sums. We show that the real part, R, of such a zero set can be approximated by the $$(n-1)$$(n-1)-dimensional skeleton, T, of a polyhedral subdivision of $$\mathbb {R}^n$$Rn. In particular, we give an explicit upper bound on the Hausdorff distance: $$\Delta (R,T) =O\left( t^{3.5}/\delta \right) $$Δ(R,T)=Ot3.5/δ, where t and $$\delta $$δ are respectively the number of terms and the minimal spacing of the… 
Spines for amoebas of rational curves
To every rational complex curve $C \subset (\mathbf{C}^\times)^n$ we associate a rational tropical curve $\Gamma \subset \mathbf{R}^n$ so that the amoeba $\mathcal{A}(C) \subset \mathbf{R}^n$ of $C$
Sublinear circuits and the constrained signomial nonnegativity problem
Conditional Sums-of-AM/GM-Exponentials (conditional SAGE) is a decomposition method to prove nonnegativity of a signomial or polynomial over some subset X of real space. In this article, we undertake
The Duality of SONC: Advances in Circuit-based Certificates
. The cone of sums of nonnegative circuits (SONCs) is a subset of the cone of nonnegative polynomials / exponential sums, which has been studied extensively in recent years. In this article, we

References

SHOWING 1-10 OF 131 REFERENCES
A-Discriminants for Complex Exponents and Counting Real Isotopy Types
TLDR
It is proved that the number of possible isotopy types for the real zero set of g is O(n^2) and the singular loci of the generalized $\mathcal{A}$-discriminants are images of low-degree algebraic sets under certain analytic maps.
Amoebas, Monge-Ampère measures, and triangulations of the Newton polytope.
The amoeba of a holomorphic function $f$ is, by definition, the image in $\mathbf{R}^n$ of the zero locus of $f$ under the simple mapping that takes each coordinate to the logarithm of its modulus.
Norms of roots of trinomials
The behavior of norms of roots of univariate trinomials $$z^{s+t} + p z^t + q \in \mathbb {C}[z]$$zs+t+pzt+q∈C[z] for fixed support $$A = \{0,t,s+t\} \subset \mathbb {N}$$A={0,t,s+t}⊂N with respect
Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
Recall that a subset of R is called semi-algebraic if it can be represented as a (finite) boolean combination of sets of the form {~ α ∈ R : p(~ α) = 0}, {~ α ∈ R : q(~ α) > 0} where p(~x), q(~x) are
Diophantine geometry and analytic spaces
Diophantine Geometry can be roughly defined as the geometric study of Diophantine equations. Historically, and for most mathematicians, those equations are polynomial equations with integer
Exponential-Polynomial Equations and Dynamical Return Sets
We show that for each finite sequence of algebraic integers α1, . . . , αn and polynomials P1(x1, . . . , xn; y1, . . . , yn), . . . , Pr(x1, . . . , xn; y1, . . . , yn) with algebraic integer
Fast Computations of the Exponential Function
TLDR
An algorithm is presented which shows that the exponential function has algebraic complexity O(log2 n), i.e., can be evaluated with relative error O(2-n) using O( log2 n) infinite-precision additions, subtractions, multiplications and divisions.
...
1
2
3
4
5
...