Related papers: Inradius of random lemniscates

We show that for a monic polynomial p of degree d, the length of the level set {z: |p(z)|=1} is at most 9.2 d, which improves an earlier estimate due to P. Borwein. For d=2 we show that the extremal level set is the Bernoullis' Lemniscate.…

Let $\Lambda$ be a finite set of nonnegative integers, and let $\mathcal P(\Lambda)$ be the linear hull of the monomials $z^k$ with $k\in\Lambda$, viewed as a subspace of $L^1$ on the unit circle. We characterize the extreme and exposed…

The top Lyapunov exponent $\lambda_+(A, p)$ of a random product of matrices in $\mathrm{GL}(d, \mathbb{R})$, $d \geq 2$, with simple top spectrum, depends real-analytically on the probability weights $p$ and the matrix coefficients $A$. We…

We compute the expectation of the number of linear spaces on a random complete intersection in $p$-adic projective space. Here "random" means that the coefficients of the polynomials defining the complete intersections are sampled uniformly…

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…

Let $n \geq 1$, and let $p : {\bf C} \to {\bf C}$ be a monic polynomial of degree $n$. It was conjectured by Erd\H{o}s, Herzog, and Piranian that the maximal length of lemniscate $\{z \in {\bf C}: |p(z)| = 1\}$ is attained by the polynomial…

Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp…

The injectivity radius of a manifold is an important quantity, both from a theoretical point of view and in terms of numerical applications. It is the largest possible radius within which all geodesics are unique and length-minimizing. In…

The function $G_\alpha(z)=1+ z/(1-\alpha z^2)$, \, $0\leq \alpha <1$, maps the open unit disc $\mathbb{D}$ onto the interior of a domain known as the Booth lemniscate. Associated with this function $G_\alpha$ is the recently introduced…

The theory of polynomial-like maps is of fundamental importance in holomorphic dynamics. We study dynamical properties of a larger class of maps. Our main result is that, under some natural conditions, a map of this class has a completely…

Let $f$ be an analytic polynomial of degree at most $K-1$. A classical inequality of Bernstein compares the supremum norm of $f$ over the unit circle to its supremum norm over the sampling set of the $K$-th roots of unity. Many extensions…

We evaluate averages involving characteristic polynomials, inverse characteristic polynomials and ratios of characteristic polynomials for a $N\times N$ random matrix taken from a $L$-deformed Chiral Gaussian Unitary Ensemble with an…

In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In…

Pellet's theorem determines when the zeros of a polynomial can be separated into two regions, according to their moduli. We refine one of those regions and replace it with the closed interior of a lemniscate that provides more precise…

We characterize the monomial complete intersections in three variables satisfying the Weak Lefschetz Property (WLP), as a function of the characteristic of the base field. Our result presents a surprising, and still combinatorially obscure,…

Let $A$ be a bounded linear operator defined on a complex Hilbert space and let $|A|=(A^*A)^{1/2}$ be the positive square root of $A$. Among other refinements of the well known numerical radius inequality $w^2(A)\leq \frac12 \|A^*A+AA^*\|$,…

We present a general framework, treating Lipschitz domains in Riemannian manifolds, that provides conditions guaranteeing the existence of norming sets and generalized local polynomial reproduction - a powerful tool used in the analysis of…

Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…

Given a univariate polynomial, its abscissa is the maximum real part of its roots. The abscissa arises naturally when controlling linear differential equations. As a function of the polynomial coefficients, the abscissa is H{\"o}lder…

The so-called "pinched disk" model of the Mandelbrot set is due to A.~Douady, J.~H.~Hubbard and W.~P.~Thurston. It can be described in the language of geodesic laminations. The combinatorial model is the quotient space of the unit disk…