Related papers: Inradius of random lemniscates
We prove combinatorial rigidity of infinitely renormalizable unicritical polynomials, P_c :z \mapsto z^d+c, with complex c, under the a priori bounds and a certain "combinatorial condition". This implies the local connectivity of the…
The problem of determining the volume of a tubular neighbourhood has a long and rich history. Bounds on the volume of neighbourhoods of algebraic sets have turned out to play an important role in the probabilistic analysis of condition…
We show that for Gaussian random SU(2)polynomials of a large degree $N$ the probability that there are no zeros in the disk of radius $r$ is less than $e^{-c_{1,r} N^2}$, and is also greater than $e^{-c_{2,r} N^2}$. Enroute to this result,…
Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…
In this paper we sharpen significantly several known estimates on the maximal number of zeros of complex harmonic polynomials. We also study the relation between the curvature of critical lemniscates and its impact on geometry of caustics…
We derive a new upper bound on the diameter of a polyhedron P = {x \in R^n : Ax <= b}, where A \in Z^{m\timesn}. The bound is polynomial in n and the largest absolute value of a sub-determinant of A, denoted by \Delta. More precisely, we…
Consider a complex one dimensional foliation on a complex surface near a singularity $p$. If $\mathcal{I}$ is a closed invariant set containing the singularity $p$, then $\mathcal{I}$ contains either a separatrix at $p$ or an invariant real…
We consider operator-valued polynomials in Gaussian Unitary Ensemble random matrices and we show that its $L^p$-norm can be upper bounded, up to an asymptotically small error, by the operator norm of the same polynomial evaluated in free…
A matrix polynomial is a polynomial in a complex variable $\lambda$ with coefficients in $n \times n$ complex matrices. The spectral curve of a matrix polynomial $P(\lambda)$ is the curve $\{ (\lambda, \mu) \in \mathbb{C}^2 \mid…
We study the $L^p$ regularity of the Bergman projection $P$ over the symmetrized polydisc in $\mathbb C^n$. We give a decomposition of the Bergman projection on the polydisc and obtain an operator equivalent to the Bergman projection over…
Heilbronn gave a sufficient condition for a number field with a totally ramified prime to fail to be norm-Euclidean. We say that Heilbronn's criterion applies to a polynomial $f$ if it applies to the number field $K=\mathbb{Q}[x]/(f)$…
Random simplices and more general random convex bodies of dimension $p$ in $\mathbb{R}^n$ with $p\leq n$ are considered, which are generated by random vectors having an elliptical distribution. In the high-dimensional regime, that is, if…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
We study the regularity of densities of distributions that are polynomial images of the standard Gaussian measure on $\mathbb{R}^n$. We assume that the degree of a polynomial is fixed and that each variable enters to a power bounded by…
We study the slices of the parameter space of cubic polynomials where we fix the multiplier of a fixed point to some value $\lambda$. The main object of interest here is the radius of convergence of the linearizing parametrization. The…
We study the statistics of the largest eigenvalue lambda_max of N x N random matrices with unit variance, but power-law distributed entries, P(M_{ij})~ |M_{ij}|^{-1-mu}. When mu > 4, lambda_max converges to 2 with Tracy-Widom fluctuations…
For any infinite field k and any positive integer r, we show constructively that the map sending each polynomial P $\in$ k[x] to its r-th iterate is dominant in various inductive limit topologies on the space of all polynomials.
Suppose that we are given an infinite binary sequence which is random for a Bernoulli measure of parameter $p$. By the law of large numbers, the frequency of zeros in the sequence tends to~$p$, and thus we can get better and better…
Let $A$ be an $(m \times n)$ integral matrix, and let $P=\{ x : A x \leq b\}$ be an $n$-dimensional polytope. The width of $P$ is defined as $ w(P)=min\{ x\in \mathbb{Z}^n\setminus\{0\} :\: max_{x \in P} x^\top u - min_{x \in P} x^\top v…
We estimate the density of tubes around the algebraic variety of decomposable univariate polynomials over the real and the complex numbers.