Related papers: A refinement of Pawlowski's result
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 study the expected number of zeros of $$P_n(z)=\sum_{k=0}^n\eta_kp_k(z),$$ where $\{\eta_k\}$ are complex-valued i.i.d standard Gaussian random variables, and $\{p_k(z)\}$ are polynomials orthogonal on the unit disk. When…
Let $f = \sum_{k=0}^n \varepsilon_k z^k$ be a random polynomial, where $\varepsilon_0,\ldots ,\varepsilon_n$ are iid standard Gaussian random variables, and let $\zeta_1,\ldots,\zeta_n$ denote the roots of $f$. We show that the point…
We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero…
Let m be a probability measure supported on some infinite and compact set K in the complex plane and let p_n(z) be the corresponding degree n orthonormal polynomial with positive leading coefficient. Let v_n be the normalized zero counting…
We prove that for any circulant matrix $C$ of size $n\times n$ with the monic characteristic polynomial $p(z)$, the spectrum of its $(n-1)\times(n-1)$ submatrix $C_{n-1}$ constructed with first $n-1$ rows and columns of $C$ consists of all…
A classical result states that if $f(z)$ is a polynomial of degree at most $n$ with nonnegative coefficients, then $f(z)$ has no zeros in the sector $|\arg(z)| < \frac{\pi}{n}$ of the complex plane, and the bound $\frac{\pi}{n}$ is tight.…
We consider the class of all analytic and locally univalent functions $f$ of the form $f(z)=z+\sum_{n=2}^\infty a_{2n-1} z^{2n-1}$, $|z|<1$, satisfying the condition $$ {\rm Re}\,\left(1+\frac{zf^{\prime\prime}(z)}{f^\prime…
Consider a sequence of random polynomials $P_n(z) = \prod_{k=1}^{n}(z - X_k)$, where $\{X_k\}_k$ are i.i.d. random variables distributed uniformly on the unit disc $\mathbb{D}$. Let $\Lambda_n = \{z \in \mathbb{C}: |P_n(z)| < 1\}$ be the…
We prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z|…
The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…
In 1959, Erd\H{o}s and Szekeres posed a series of problems concerning the size of polynomials of the form $$ P_n(z) = \prod_{j=1}^n (1 - z^{s_j}), $$ where $s_1, \dots, s_n$ are positive integers. Of particular interest is the quantity $$…
We study inequalities connecting the product of uniform norms of polynomials with the norm of their product. This circle of problems include the Gelfond-Mahler inequality for the unit disk and the Kneser-Borwein inequality for the segment…
For an analytic and univalent function $f$ in the unit disk $\mathbb{D}:=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$, the logarithmic coefficients $\gamma_n$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…
Sendov's conjecture states that if all the zeroes of a complex polynomial $P(z)$ of degree at least two lie in the unit disk, then within a unit distance of each zero lies a critical point of $P(z)$. In a paper that appeared in 2014,…
For functions $p(z) = 1 + \sum_{n=1}^\infty p_n z^n$ holomorphic in the unit disk, satisfying $ {\rm Re}\, p(z) > 0$, we generalize two inequalities proved by Livingston in 1969 and 1985, and simplify their proofs. One of our results states…
Erd\"os posed in 1940 the extremal problem of studying the minimal area of the lemniscate $\{|p(z)|<1\}$ of a monic polynomial $p$ of degree $n$ all of whose zeros are in the closed unit disc. In this article, we prove that there exist…
Given a finite group $G$ and a set $A$ of generators, the diameter diam$(\Gamma(G,A))$ of the Cayley graph $\Gamma(G,A)$ is the smallest $\ell$ such that every element of $G$ can be expressed as a word of length at most $\ell$ in $A \cup…
The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ is defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…
The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…