Related papers: Asymptotic $L^4$ norm of polynomials derived from …
We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…
We consider a new multivariate generalization of the classical monic (univariate) Chebyshev polynomial that minimizes the uniform norm on the interval $[-1,1]$. Let $\Pi^*_n$ be the subset of polynomials of degree at most $n$ in $d$…
The first part of this paper is devoted to the study of the orthogonal polynomial on the circle, with respect of a weight of type $f_\alpha (\theta) = (2\cos \theta- 2\cos \theta_0)^{2\alpha} c_1$ with $\theta_0 \in ]0,\pi[$, -1/2…
Bonamy et al \cite{BBEGLPS} showed that graphs of polynomial growth have finite asymptotic dimension. We refine their result showing that a graph of polynomial growth strictly less than $n^{k+1}$ has asymptotic dimension at most $k$. As a…
The large $n$ behaviour of the hypergeometric polynomial $$\FFF{-n}{\sfrac12}{\sfrac12}{\sfrac12-n}{\sfrac12-n}{-1}$$ is considered by using integral representations of this polynomial. This ${}_3F_2$ polynomial is associated with the…
Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…
We study the asymptotics of recurrence coefficients for monic orthogonal polynomials $\pi_n(z)$ with the quartic exponential weight $\exp[-N(\frac 12 z^2+\frac 14 tz^4)]$, where $t\in {\mathbb C}$ and $N\in{\mathbb N}$, $N\to\infty$. Our…
In this paper we study the asymptotic behavior of the (skew) Macdonald and Jack symmetric polynomials as the number of variables grows to infinity. We characterize their limits in terms of certain variational problems. As an intermediate…
A system of linear differential equations with oscillatory decreasing coefficients is considered. The coefficients has the form $t^{-\alpha}a(t)$,~$\alpha>0$, where $a(t)$ is trigonometric polynomial with an arbitrary set of frequencies.…
We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of polynomial threshold functions. More specifically, for a Boolean function f on n variables equal to the sign of a real, multivariate polynomial…
In this note, we prove a central limit theorem for smooth linear statistics of zeros of random polynomials which are linear combinations of orthogonal polynomials with iid standard complex Gaussian coefficients. Along the way, we obtain…
The coefficient sequences of multivariate rational functions appear in many areas of combinatorics. Their diagonal coefficient sequences enjoy nice arithmetic and asymptotic properties, and the field of analytic combinatorics in several…
Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…
We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…
Consider a trigonometric polynomial f of degree N, and associate to it the polynomial F in which each coefficient of f is replaced by its absolute value. F is called the majorant of f. We show that the L^3 norm of f can be larger than that…
We show that every real polynomial $f$ nonnegative on $[-1,1]^{n}$ can be approximated in the $l_{1}$-norm of coefficients, by a sequence of polynomials $\{f_{\ep r}\}$ that are sums of squares. This complements the existence of s.o.s.…
We prove that the Littlewood conjecture is satisfied for a restricted class of pairs $(\alpha,\beta)$ of badly approximable numbers. We use the localization of the roots of a cubic equation with coefficients depending on the diophantine…
We consider the problem of existence of polynomials with small norm. This range of problems has been extensively studied by many authors in the case of the unit circle (or a compact Abelian group), i.e. when the characters are bounded. In…
Starting from Montgomery's conjecture, there has been a substantial interest on the connections of random matrix theory and the theory of L-functions. In particular, moments of characteristic polynomials of random matrices have been…
We prove distributional results for mixed character sums \begin{equation*} \sum_{n\le x }\chi(n)e(n\theta), \end{equation*} for fixed $\theta\in [0,1]$ and random character $\chi \pmod q$, as well as for a fixed character $\chi$ and…