To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Let $\Omega _1, \ldots , \Omega _m$ be probability spaces, let ${\mathbf \Omega }=\Omega _1 \times \cdots \times \Omega _m$ be their product and let $A_1, \ldots , A_n \subset {\mathbf \Omega }$ be events. Suppose that each event $A_i$ depends on $r_i$ coordinates of a point $x \in {\mathbf \Omega }$, $x=\left (\xi _1, \ldots , \xi _m\right )$, and that for each event $A_i$ there are $\Delta _i$ other events $A_j$ that depend on some of the coordinates that $A_i$ depends on. Let $\Delta =\max \{5,\ \Delta _i\,:\, i=1, \ldots , n\}$ and let $\mu _i=\min \{r_i,\ \Delta _i+1\}$ for $i=1, \ldots , n$. We prove that if ${\mathbb P}(A_i) \lt (3\Delta )^{-3\mu _i}$ for all $i$, then for any $0 \lt \epsilon \lt 1$, the probability ${\mathbb P}\left ( \bigcap _{i=1}^n \overline {A}_i\right )$ of the intersection of the complements of all $A_i$ can be computed within relative error $\epsilon$ in polynomial time from the probabilities ${\mathbb P}\left (A_{i_1} \cap \ldots \cap A_{i_k}\right )$ of $k$-wise intersections of the events $A_i$ for $k = e^{O(\Delta )} \ln (n/\epsilon )$.
Given a polynomial $\sum _\nu a_\nu X^\nu $ of degree $<d$, bounded by one on the unit disk, how large can $ \left \lvert {a_0+a_1+\ldots +a_n} \right \rvert $ ($n<d$) get? This question dates back at least to the 1952 thesis work of H. S. Shapiro. In 1978, D. J. Newman gave an exact answer for $d=2(n+1)$, but there does not seem to have been further progress on the question since. We study variations on exact answers for some related coefficient sums, and answer the original question in an asymptotic sense, provided that n is ‘not too large’ in terms of d. The latter is achieved via a ‘quantitative’ Eneström–Kakeya theorem, while the former is based on certain identities for carefully selected Lagrange interpolators. From the interpolation approach we also obtain a general inequality for coefficient sums $ \left \lvert { t_0 a_0 + \ldots + t_{d-1} a_{d-1} } \right \rvert $ for arbitrary complex numbers $t_0,\ldots ,t_{d-1}$. This inequality fails to be sharp in general, yet it is in some cases and also yields non-trivial bounds for Shapiro’s problem for some choices of n and d.
The well-known proof of Beurling’s Theorem in the Hardy space $H^2$, which describes all shift-invariant subspaces, rests on calculating the orthogonal projection of the unit constant function onto the subspace in question. Extensions to other Hardy spaces $H^p$ for $0 < p < \infty $ are usually obtained by reduction to the $H^2$ case via inner–outer factorization of $H^p$ functions. In this article, we instead explicitly calculate the metric projection of the unit constant function onto a shift-invariant subspace of the Hardy space $H^p$ when $1<p<\infty $. This problem is equivalent to finding the best approximation in $H^p$ of the conjugate of an inner function. In $H^2$, this approximation is always a constant, but in $H^p$, when $p\neq 2$, this approximation turns out to be zero or a non-constant outer function. Further, we determine the exact distance between the unit constant and any shift-invariant subspace and propose some open problems. Our results use the notion of Birkhoff–James orthogonality and Pythagorean inequalities, along with an associated dual extremal problem, which leads to some interesting inequalities. Further consequences shed light on the lattice of shift-invariant subspaces of $H^p$, as well as the behavior of the zeros of optimal polynomial approximants in $H^p$.
We consider the relationship between the Mahler measure $M(f)$ of a polynomial f and its separation $\operatorname {sep}(f)$. Mahler [‘An inequality for the discriminant of a polynomial’, Michigan Math. J.11 (1964), 257–262] proved that if $f(x) \in \mathbb {Z}[x]$ is separable of degree n, then $\operatorname {sep}(f) \gg _n M(f)^{-(n-1)}$. This spurred further investigations into the implicit constant involved in that relationship and led to questions about the optimal exponent on $M(f)$. However, there has been relatively little study concerning upper bounds on $\operatorname {sep}(f)$ in terms of $M(f)$. We prove that if $f(x) \in \mathbb {C}[x]$ has degree n, then $\operatorname {sep}(f) \ll n^{-1/2}M(f)^{1/(n-1)}$. Moreover, this bound is sharp up to the implied constant factor. We further investigate the constant factor under various additional assumptions on $f(x)$; for example, if it has only real roots.
where $f(z)=\sum _{n=0}^\infty a_n z^n \in H({\mathbb D})$ and $(X_n)_{n \geq 0}$ is a standard sequence of independent Bernoulli, Steinhaus, or complex Gaussian random variables. In this paper, we demonstrate that prescribing a polynomial growth rate for random analytic functions over the unit disk leads to rather satisfactory characterizations of those $f \in H({\mathbb D})$ such that ${\mathcal R} f$ admits a given rate almost surely. In particular, we show that the growth rate of the random functions, the growth rate of their Taylor coefficients, and the asymptotic distribution of their zero sets can mutually, completely determine each other. Although the problem is purely complex analytic, the key strategy in the proofs is to introduce a class of auxiliary Banach spaces, which facilitate quantitative estimates.
For any real polynomial $p(x)$ of even degree k, Shapiro [‘Problems around polynomials: the good, the bad and the ugly$\ldots $’, Arnold Math. J.1(1) (2015), 91–99] proposed the conjecture that the sum of the number of real zeros of the two polynomials $(k-1)(p{'}(x))^{2}-kp(x)p{"}(x)$ and $p(x)$ is larger than 0. We prove that the conjecture is true except in one case: when the polynomial $p(x)$ has no real zeros, the derivative polynomial $p{'}(x)$ has one real simple zero, that is, $p{'}(x)=C(x)(x-w)$, where $C(x)$ is a polynomial with $C(w)\ne 0$, and the polynomial $(k-1)(C(x))^2(x-w)^{2}-kp(x)C{'}(x)(x-w)-kC(x)p(x)$ has no real zeros.
Granville recently asked how the Mahler measure behaves in the context of polynomial dynamics. For a polynomial $f(z)=z^d+\cdots \in {\mathbb C}[z],\ \deg (f)\ge 2,$ we show that the Mahler measure of the iterates $f^n$ grows geometrically fast with the degree $d^n,$ and find the exact base of that exponential growth. This base is expressed via an integral of $\log ^+|z|$ with respect to the invariant measure of the Julia set for the polynomial $f.$ Moreover, we give sharp estimates for such an integral when the Julia set is connected.
We consider an analogue of Kontsevich’s matrix Airy function where the cubic potential $\textrm{Tr}(\Phi^3)$ is replaced by a quartic term $\textrm{Tr}\!\left(\Phi^4\right)$. Cumulants of the resulting measure are known to decompose into cycle types for which a recursive system of equations can be established. We develop a new, purely algebraic geometrical solution strategy for the two initial equations of the recursion, based on properties of Cauchy matrices. These structures led in subsequent work to the discovery that the quartic analogue of the Kontsevich model obeys blobbed topological recursion.
We characterize zero sets for which every subset remains a zero set too in the Fock space $\mathcal {F}^p$, $1\leq p<\infty $. We are also interested in the study of a stability problem for some examples of uniqueness set with zero excess in Fock spaces.
In this paper, we consider the family of nth degree polynomials whose coefficients form a log-convex sequence (up to binomial weights), and investigate their roots. We study, among others, the structure of the set of roots of such polynomials, showing that it is a closed convex cone in the upper half-plane, which covers its interior when n tends to infinity, and giving its precise description for every $n\in \mathbb {N}$, $n\geq 2$. Dual Steiner polynomials of star bodies are a particular case of them, and so we derive, as a consequence, further properties for their roots.
We consider the problem of computing the partition function $\sum _x e^{f(x)}$, where $f: \{-1, 1\}^n \longrightarrow {\mathbb R}$ is a quadratic or cubic polynomial on the Boolean cube $\{-1, 1\}^n$. In the case of a quadratic polynomial f, we show that the partition function can be approximated within relative error $0 < \epsilon < 1$ in quasi-polynomial $n^{O(\ln n - \ln \epsilon )}$ time if the Lipschitz constant of the non-linear part of f with respect to the $\ell ^1$ metric on the Boolean cube does not exceed $1-\delta $, for any $\delta>0$, fixed in advance. For a cubic polynomial f, we get the same result under a somewhat stronger condition. We apply the method of polynomial interpolation, for which we prove that $\sum _x e^{\tilde {f}(x)} \ne 0$ for complex-valued polynomials $\tilde {f}$ in a neighborhood of a real-valued f satisfying the above mentioned conditions. The bounds are asymptotically optimal. Results on the zero-free region are interpreted as the absence of a phase transition in the Lee–Yang sense in the corresponding Ising model. The novel feature of the bounds is that they control the total interaction of each vertex but not every single interaction of sets of vertices.
En s’appuyant sur la notion d’équivalence au sens de Bohr entre polynômes de Dirichlet et sur le fait que sur un corps quadratique la fonction zeta de Dedekind peut s’écrire comme produit de la fonction zeta de Riemann et d’une fonction L, nous montrons que, pour certaines valeurs du discriminant du corps quadratique, les sommes partielles de la fonction zeta de Dedekind ont leurs zéros dans des bandes verticales du plan complexe appelées bandes critiques et que les parties réelles de leurs zéros y sont denses.
Let $(z_k)$ be a sequence of distinct points in the unit disc $\mathbb {D}$ without limit points there. We are looking for a function $a(z)$ analytic in $\mathbb {D}$ and such that possesses a solution having zeros precisely at the points $z_k$, and the resulting function $a(z)$ has ‘minimal’ growth. We focus on the case of non-separated sequences $(z_k)$ in terms of the pseudohyperbolic distance when the coefficient $a(z)$ is of zero order, but $\sup _{z\in {\mathbb D}}(1-|z|)^p|a(z)| = + \infty$ for any $p > 0$. We established a new estimate for the maximum modulus of $a(z)$ in terms of the functions $n_z(t)=\sum \nolimits _{|z_k-z|\le t} 1$ and $N_z(r) = \int_0^r {{(n_z(t)-1)}^ + } /t{\rm d}t.$ The estimate is sharp in some sense. The main result relies on a new interpolation theorem.
Let $p:\mathbb{C}\rightarrow \mathbb{C}$ be a polynomial. The Gauss–Lucas theorem states that its critical points, $p^{\prime }(z)=0$, are contained in the convex hull of its roots. We prove a stability version whose simplest form is as follows: suppose that $p$ has $n+m$ roots, where $n$ are inside the unit disk,
then $p^{\prime }$ has $n-1$ roots inside the unit disk and $m$ roots at distance at least $(dn-m)/(n+m)>1$ from the origin and the involved constants are sharp. We also discuss a pairing result: in the setting above, for $n$ sufficiently large, each of the $m$ roots has a critical point at distance ${\sim}n^{-1}$.
This work studies slice functions over finite-dimensional division algebras. Their zero sets are studied in detail along with their multiplicative inverses, for which some unexpected phenomena are discovered. The results are applied to prove some useful properties of the subclass of slice regular functions, previously known only over quaternions. Firstly, they are applied to derive from the maximum modulus principle a version of the minimum modulus principle, which is in turn applied to prove the open mapping theorem. Secondly, they are applied to prove, in the context of the classification of singularities, the counterpart of the Casorati-Weierstrass theorem.
where the infimum is over all Dirichlet polynomials
$${{A}_{N}}\left( s \right)\,=\,\sum\limits_{n=1}^{N}{\frac{{{a}_{n}}}{{{n}^{s}}}}$$
of length $N$. In this paper we investigate $d_{N}^{2}$ under the assumption that the Riemann zeta function has four nontrivial zeros off the critical line.
We give a short and elementary proof of an inverse Bernstein-type inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle. The inequality is used to show that equally-spaced points solve a min–max–min problem for the logarithmic potential of such polynomials. Using techniques recently developed for polarization (Chebyshev-type) problems, we show that this optimality also holds for a large class of potentials, including the Riesz potentials $1/r^{s}$ with $s>0.$
We investigate the location and separation of zeros of certain three-term linear combination of translates of polynomials. In particular, we find an interval of the form I = [−1, 1 + h], h > 0 such that for a polynomial f, all of whose zeros are real, and λ ∈ I, all zeros of f (x + 2ic) + 2λf (x) + f (x – 2ic) are also real.