SearcharxivSearch

arXiv · 2411.11345

Real Gaussian exponential sums via a real moment map

Abstract

We study the expected number of solutions of a system of identically distributed exponential sums with centered Gaussian coefficient and arbitrary variance. We use the Adler and Taylor theory of Gaussian random fields to identify a moment map which allows to express the expected number of solution as an integral over the Newton polytope, in analogy with the Bernstein Khovanskii Kushnirenko Theorem. We apply this result to study the monotonicity of the expected number of solution with respect to the support of the exponential sum in an open set. We find that, when a point is added in the support in the interior of the Newton polytope there exists an open sets where the expected number of solutions decreases, answering negatively to a local version of a conjecture by B\"urgisser. When the point added in the support is far enough away from the Newton polytope we show that there is an unbounded open set where the number of solution decreases. We also prove some new lower bounds for the Aronszajn multiplication of exponential sums.

Explore related subjects

Keep this discovery

BibTeXRIS

Léo Mathis. 2024-11-18. Real Gaussian exponential sums via a real moment map. https://arxiv.org/abs/2411.11345

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR