Related papers: Solutions to polynomial congruences in well shaped…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

Je retracerai l'histoire des conjectures de Weil sur le nombre de solutions d'\'equations polynomiales dans un corps fini et quelques unes des approches qui ont \'et\'e propos\'ees pour les r\'esoudre. The Weil conjectures: origins,…

In this paper, we exploit the concavity of sums of Hessian operators to derive Pogorelov estimates for corresponding equations under the dynamic semi-convexity assumption, and we further obtain several Liouville-type results. Moreover, when…

We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…

We show that the exceptional orthogonal polynomials can be viewed as confluent limits of the generalized Schur polynomials introduced by Sergeev and Veselov.

We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems…

We describe a congruence property of solvable polynomials over Q, based on the irreducibility of cyclotomic polynomials over number fields that meet certain conditions.

Recently, Corvaja and Zannier obtained an extension of the Subspace Theorem with arbitrary homogeneous polynomials of arbitrary degreee instead of linear forms. Their result states that the set of solutions in P^n(K) (K number field) of the…

In this paper, we develop a method of evaluating general exponential sums with rational amplitude functions for multiple variables which complements works by T. Cochrane and Z. Zheng on the single variable case. As an application, for…

We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.

This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…

We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

We use decoupling theory to estimate the number of solutions for quadratic and cubic Parsell--Vinogradov systems in two dimensions.

We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…

Via the solutions of systems of algebraic equations of Bethe Ansatz type, we arrive at bounds for the zeros of orthogonal (basic) hypergeometric polynomials belonging to the Askey-Wilson, Wilson and continuous Hahn families.

In this paper we consider the solvability of a non-convex regular polynomial vector optimization problem on a nonempty closed set. We introduce regularity conditions for the polynomial vector optimization problem and study properties and…

We study the average condition number for polynomial eigenvalues of collections of matrices drawn from various random matrix ensembles. In particular, we prove that polynomial eigenvalue problems defined by matrices with Gaussian entries…