Related papers: A moment ratio bound for polynomials and some extr…
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…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
Given a probability measure $\mu$ with infinite support on the unit circle $\partial\mathbb{D}=\{z:|z|=1\}$, we consider a sequence of paraorthogonal polynomials $\h_n(z,\lambda)$ vanishing at $z=\lambda$ where $\lambda \in \T$ is fixed. We…
Our main result has topological, combinatorial and computational flavor. It is motivated by a fundamental conjecture stating that computing Khovanov homology of a closed braid of fixed number of strands has polynomial time complexity. We…
For a given knot $K$ and $w>0$, we construct infinitely many mutually distinct hyperbolic knots $\{K_i\}$ such that the $P$-satellites of $K$ and $K_i$ have the same HOMFLY polynomial up to given $z$-degrees, for all braided patterns $P$…
There has been significant interest in studying the asymptotics of certain generalised moments, called the moments of moments, of characteristic polynomials of random Haar-distributed unitary and symplectic matrices, as the matrix size $N$…
We design new polynomials for representing threshold functions in three different regimes: probabilistic polynomials of low degree, which need far less randomness than previous constructions, polynomial threshold functions (PTFs) with…
The Bohnenblust--Hille inequality says that the $\ell^{\frac{2m}{m+1}}$-norm of the coefficients of an $m$-homogeneous polynomial $P$ on $\C^n$ is bounded by $\| P\|_\infty$ times a constant independent of $n$, where $\|\cdot \|_\infty$…
In 1931 Bohnenblust and Hille proved that for each m-homogeneous polynomial $\sum_{|\alpha| = m} a_\alpha z^\alpha$ on $\C^n$ the $\ell^{\frac{2m}{m+1}}$-norm of its coefficients is bounded from above by a constant $C_m$ (depending only on…
In this paper we introduce a polynomial frame on the unit sphere $\sph$ of $\mathbb{R}^d$, for which every distribution has a wavelet-type decomposition. More importantly, we prove that many function spaces on the sphere $\sph$, such as…
We give a {\em deterministic} algorithm for approximately computing the fraction of Boolean assignments that satisfy a degree-$2$ polynomial threshold function. Given a degree-2 input polynomial $p(x_1,\dots,x_n)$ and a parameter $\eps >…
We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…
Since the seminal work of Keating and Snaith, the characteristic polynomial of a random Haar-distributed unitary matrix has seen several of its functional studied or turned into a conjecture; for instance: $ \bullet $ its value in $1$…
The moment-SOS hierarchy is a widely applicable framework to address polynomial optimization problems over basic semi-algebraic sets based on positivity certificates of polynomial. Recent works show that the convergence rate of this…
We study the fluctuations of random surfaces on a two-dimensional discrete torus. The random surfaces we consider are defined via a nearest-neighbor pair potential which we require to be twice continuously differentiable on a (possibly…
We prove Hunter's conjecture on complete homogeneous symmetric polynomials. For even $n$ and every integer $k\geq 1$, we show that under the constraint $\sum_{i=1}^n a_i^2=1$ the global minimum of the even-degree polynomial…
We sharpen the bound $n^{2k}$ on the maximum modulus of the $k^{{\rm th}}$ radial derivative of the Zernike circle polynomials (disk polynomials) of degree $n$ to $n^2(n^2-1^2)\cdot ... \cdot(n^2-(k-1)^2)/2^k(1/2)_k$. This bound is obtained…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…
We prove the first inverse theorem for point--sphere incidence bounds over finite fields in dimensions $d \ge 3$, showing that near-extremality forces algebraic rigidity. While sharp upper bounds have been known for over a decade, the…