Related papers: Tropical Varieties for Exponential Sums

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

We show that if $\partial\mathcal{R}$ is the boundary of the range of super-Brownian motion and dim denotes Hausdorff dimension, then with probability one, for any open set $U$, $\partial\mathcal{R}\cap U\neq\emptyset$ implies…

We show that every real nonnegative polynomial $f$ can be approximated as closely as desired by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. Each $f_\epsilon$ has a simple et explicit form in terms of $f$ and…

The Hausdorff dimension of the set of simultaneously tau well approximable points lying on a curve defined by a polynomial P(X)+alpha, where P(X) is a polynomial with integer coefficients and alpha is in R, is studied when tau is larger…

Gelfond and Khovanskii found a formula for the sum of the values of a Laurent polynomial at the zeros of a system of n Laurent polynomials in the complex n-torus whose Newton polyhedra have generic mutual positions. An exponential change of…

Treedepth is a central parameter to algorithmic graph theory. The current state-of-the-art in computing and approximating treedepth consists of a $2^{O(k^2)} n$-time exact algorithm and a polynomial-time $O(\text{OPT} \log^{3/2}…

Let $P:\{0,1\}^k \to \{0,1\}$ be a nontrivial $k$-ary predicate. Consider a random instance of the constraint satisfaction problem $\mathrm{CSP}(P)$ on $n$ variables with $\Delta n$ constraints, each being $P$ applied to $k$ randomly chosen…

Given any complex Laurent polynomial $f$, $\mathrm{Amoeba}(f)$ is the image of its complex zero set under the coordinate-wise log absolute value map. We give an efficiently constructible polyhedral approximation, $\mathrm{ArchtTrop}(f)$, of…

We show that if k-SUM is hard, in the sense that the standard algorithm is essentially optimal, then a variant of the SETH called the Primal Treewidth SETH is true. Formally: if there is an $\varepsilon>0$ and an algorithm which solves SAT…

The problem of finding the correct asymptotic rate of approximation by polynomial loops in dependence of the smoothness of the elements of a loop group seems not well-understood in general. For matrix Lie groups such as SU(N), it can be…

We prove the multivariate Fujiwara bound for exponential sums: for a $d$-variate exponential sum $f$ with scaling parameter $\mu$, if $x$ is contained in the amoeba $\mathscr{A}(f)$, then the distance from $x$ to the Archimedean tropical…

We derive the large $n$ asymptotics of zeros of sections of a generic exponential sum. We divide all the zeros of the $n$-th section of the exponential sum into ``genuine zeros'', which approach, as $n\to\infty$, the zeros of the…

In this paper we derive uniform asymptotic expansions for the partial sums of the exponential series. We indicate how this information will be used in a later publication to obtain full and explicitly computable asymptotic expansions with…

The $s$-th higher topological complexity of a space $X$, $TC_s(X)$, can be estimated from above by homotopical methods, and from below by homological methods. We give a thorough analysis of the gap between such estimates when $X=RP^m$, the…

We consider an \eps-approximation by n-term partial sums of the Karhunen-Lo\`eve expansion to d-parametric random fields of tensor product-type in the average case setting. We investigate the behavior, as d tends to infinity, of the…

While there is extensive literature on approximation, deterministic as well as random, of general convex bodies $K$ in the symmetric difference metric, or other metrics arising from intrinsic volumes, very little is known for corresponding…

Let $R^{\frac{1}{2}}$ be a large integer, and $\omega$ be a nonnegative weight in the $R$-ball $B_R=[0,R]^2$ such that $\omega(B_R)\le R$. For any complex sequence $\{a_n\}$, define the quadratic exponential sum \[…

We prove that the Hausdorff dimension of the set $\mathbf{x}\in [0,1)^d$, such that $$ \left|\sum_{n=1}^N \exp\left(2 \pi i\left(x_1n+\ldots+x_d n^d\right)\right) \right|\ge c N^{1/2} $$ holds for infinitely many natural numbers $N$, is at…

The 3SUM problem represents a class of problems conjectured to require $\Omega (n^2)$ time to solve, where $n$ is the size of the input. Given two polygons $P$ and $Q$ in the plane, we show that some variants of the decision problem,…

We consider the unconstrained optimization of multivariate trigonometric polynomials by the sum-of-squares hierarchy of lower bounds. We first show a convergence rate of $O(1/s^2)$ for the relaxation with degree $s$ without any assumption…