On the zeros of random harmonic polynomials: the Weyl model

Andrew Thomack; Zachariah Tyree

Home/Archive/arXiv

arXiv · 1710.06906

On the zeros of random harmonic polynomials: the Weyl model

Andrew Thomack·Zachariah Tyree

View original source ↗Read source document ↗Export metadata ↓

Abstract

Li and Wei (2009) studied the density of zeros of Gaussian harmonic polynomials with independent Gaussian coefficients. They derived a formula for the expected number of zeros of random harmonic polynomials as well as asymptotics for the case that the polynomials are drawn from the Kostlan ensemble. In this paper we extend their work to cover the case that the polynomials are drawn from the Weyl ensemble by deriving asymptotics for this class of harmonic polynomials.

Explore related subjects

math.CV math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Andrew Thomack, Zachariah Tyree. 2017-10-18. On the zeros of random harmonic polynomials: the Weyl model. https://arxiv.org/abs/1710.06906

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A Product Principle for Harmonic Schwarz Lemmas: Boxes, Polydiscs, and Metric Geometry

We establish an exact product principle for the Euclidean operator norm of differentials of harmonic maps. For a bounded domain $G\subset\R^m$ and $p\in G$, let $M_G(p)$ denote the supremum of $\|dF_0\|$ over harmonic maps $F:\D\to G$ with $F(0)=p$. For bounded domains $G_j\subset\R^{m_j}$, we prove \[ M_{G_1\times\cdots\times G_N}(p_1,\ldots,p_N)^2 =\sum_{j=1}^N M_{G_j}(p_j)^2. \] The theorem separates the geometry of the individual factors from the Euclidean geometry of the product: the factor extremal constants combine by a sum-of-squares law, while equality is governed by a single compatibility condition, namely a common maximizing direction for the component differentials. Neither convexity nor attainment of the factor suprema is required. Combining the product principle with the sharp interval and disk factor problems yields exact operator-norm estimates and all equality cases for harmonic maps into boxes and polydiscs. In both families, for every extremal map, the real differential at the origin has one-dimensional image. The same factor constants also define coordinatewise metrics for which the harmonic contraction estimate is sharp when the source disk is equipped with its Poincaré metric of curvature $-1$. For boxes, the resulting metric is complete and equals twice the restriction of the Kobayashi-Royden metric of the product of vertical strips. For polydiscs, the harmonic product metric is pointwise maximal among contracting metrics of the form $\max_j a_j(p)|v_j|$, with $a_j(p)>0$. It is strictly smaller than twice the Kobayashi-Royden metric on every nonzero tangent vector, and its induced path metric is incomplete.

math.CV↗

arXiv2026

A Demailly-type approximation of singular Finsler metrics

We establish a Demailly-type approximation theorem for singular Finsler metrics satisfying the multiple coarse $L^p$ extension property on holomorphic vector bundles. As an application, we obtain a new proof of the fact that the multiple coarse $L^p$ extension property characterizes Griffiths positivity, as shown by Deng--Wang--Zhang--Zhou.

math.CV↗

arXiv2026

A computer-assisted lower bound for Landau's constant

We prove the lower bounds \[ B_\infty>0.51,\qquad L>0.51, \] where $B_\infty$ is the locally univalent Bloch constant and $L$ is Landau's constant, improving the bound $\frac{1}{2}+2\cdot10^{-8}$ of Chen and Shiba. The argument passes to the logarithm $g=\log f'$ of a normalized locally univalent Bloch function, where the Bloch condition becomes a one-sided linear constraint on $\operatorname{Re} g$; positive Toeplitz moment matrices then provide a finite-dimensional outer relaxation for the low logarithmic coefficients, and any non-negative dual vector for a linear program over that relaxation certifies a bound. Floating-point linear programming is used only to discover such dual vectors; the same duality also certifies the second-derivative bounds that control the Taylor allowances and the coefficient caps that contract the cover. An independent arbitrary-precision interval-arithmetic program reconstructs every witness and checks a finite cover of the normalized coefficient body by $1179$ boxes, the smallest certified radius being $0.51003$. All numerical premises were verified with Arb at $80$ decimal digits.

math.CV↗