SearcharxivSearch

arXiv subjects

Koushik Ramachandran

Publications and source records attributed to Koushik Ramachandran.

15 recordsLinked to original sources

A note on the Erdös minimal area problem

We answer a question of Erdős, Herzog, and Piranian \cite[Problem $4$, page $135$]{EHP} on the minimal area of polynomial lemniscates when all the zeros of the polynomial are constrained to lie on a compact set $K$ whose logarithmic capacity is greater than $1$. We show that the minimal area decays exponentially fast and prove that the Fekete polynomials are asymptotic minimizers for the area problem.

math.CV

Counterexamples to Magnanini's conjecture concerning critical points of the torsion function

We construct planar simply-connected domains whose torsion function has an arbitrary prescribed number of local maxima while the distance to the boundary has only one local maximum inside the domain. This disproves a conjecture of Magnanini asserting that the number of local maxima of the torsion function is bounded above by the number of local maxima of the distance function to the boundary. We also answer a question of Steinerberger concerning the eccentricity of level sets near the point where the torsion function attains its maximum in simply-connected domains.

math.AP

Asymptotics of the Number of Components of Random Polynomial Lemniscates

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 $Λ_n = \{z \in \mathbb{C}: |P_n(z)| < 1\}$ be the lemniscate of $P_n$, and let $\mathscr{C}(Λ_n)$ be the number of connected components of $Λ_n$. In this paper, we prove that $\lim_{n\to\infty}\frac{\mathbb{E}[\mathscr{C}(Λ_n)]}{\sqrt{n}}= γ$, and identify the constant $γ$.

math.PR

On the area of polynomial lemniscates

Erdös 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 positive constants $c,C$ independent of the degree $n$ such that \[ \dfrac{c}{\log n} \leq \min \text{Area}( \{ |p(z)|<1 \} ) \leq \frac{C}{\log \log n},\] improving substantially the previously best known lower bound (due to Pommerenke in 1961) as well as improving the best known upper bound (due to Wagner in 1988). We also study the inradius (radius of the largest inscribed disc); we provide an estimate for the inradius in terms of the area that confirms a 2009 conjecture of Solynin and Williams, and we use this to give a lower bound of order $(n \sqrt{\log n})^{-1}$ on the inradius, addressing a 1958 problem posed by Erdös, Herzog, and Piranian (confirming their conjecture up to the logarithmic factor). In addition to studying the area of $\{|p(z)|<1\}$, we consider other sublevel sets $\{|p(z)| 1$ and proving power law upper and lower bounds when $0<t<1$. We also consider the minimal area problem under a more general constraint, namely, replacing the unit disc with a compact set $K$ of unit capacity, where we show that the minimal area converges to zero as $n \rightarrow \infty$ (giving an affirmative answer to another question of Erdös, Herzog, Piranian); we also investigate the structure of the area minimizing polynomials, showing that the normalized zero-counting measure converges to the equilibrium measure of $K$ as the degree $n \rightarrow \infty$.

math.CV

Number of components of polynomial lemniscates: a problem of Erdös, Herzog, and Piranian

Let $K\subset\mathbb{C}$ be a compact set in the plane whose logarithmic capacity $c(K)$ is strictly positive. Let $\mathscr{P}_n(K)$ be the space of monic polynomials of degree $n,$ \emph{all} of whose zeros lie in $K.$ For $p\in \mathscr{P}_n(K),$ its filled \emph{unit leminscate} is defined by $Λ_p = \{z: |p(z)| < 1\}.$ Let $\mathcal{C}(Λ_p) $ denote the number of connected components of the open set $Λ_p,$ and define $\mathscr{C}_n(K) = \max_{p\in \mathscr{P}_n(K)}\mathcal{C}(Λ_p).$ In this paper we show that the quantity \[M(K) = \limsup_{n\to\infty}\dfrac{\mathscr{C}_n(K)}{n},\] satisfies $M(K) < 1$ when the logarithmic capacity $c(K) < 1,$ and $M(K) = 1$ when $c(K)\geq 1.$ In particular, this answers a question of Erdös et. al. posed in $1958$. In addition, we show that for nice enough compact sets whose capacity is strictly bigger than $\frac{1}{2}$, the quantity $m(K) = \liminf_{n\to\infty}\dfrac{\mathscr{C}_n(K)}{n} > 0.$

math.CV

Inradius of random lemniscates

A classically studied geometric property associated to a complex polynomial $p$ is the inradius (the radius of the largest inscribed disk) of its (filled) lemniscate $Λ:= \{z \in \mathbb{C}:|p(z)| < 1\}$. In this paper, we study the lemniscate inradius when the defining polynomial $p$ is random, namely, with the zeros of $p$ sampled independently from a compactly supported probability measure $μ$. If the negative set of the logarithmic potential $U_μ$ generated by $μ$ is non-empty, then the inradius is bounded from below by a positive constant with overwhelming probability. Moreover, the inradius has a determinstic limit if the negative set of $U_μ$ additionally contains the support of $μ$. On the other hand, when the zeros are sampled independently and uniformly from the unit circle, then the inradius converges in distribution to a random variable taking values in $(0,1/2)$. We also consider the characteristic polynomial of a Ginibre random matrix whose lemniscate we show is close to the unit disk with overwhelming probability.

math.PR

Conformal Rigidity of Polar Set Complements

Let $E$ be a closed polar subset of $\mathbb{C}$. In this short note, we use elementary potential theoretic tools to show that any conformal map on $\mathbb{C}\setminus{E}$ is necessarily a Möbius map. As a consequence we obtain that the group of conformal automorphisms of the complement of a closed polar set $E$ is a discrete subgroup of the Möbius group, provided $\lvert E \rvert \ge 2$.

math.CV

A note on the critical points of the localization landscape

Let $Ω\subset\mathbb{C}$ be a bounded domain. In this note, we use complex variable methods to study the number of critical points of the function $v=v_Ω$ that solves the elliptic problem $Δv = -2$ in $Ω,$ with boundary values $v=0$ on $\partialΩ.$ This problem has a classical flavor but is especially motivated by recent studies on localization of eigenfunctions. We provide an upper bound on the number of critical points of $v$ when $Ω$ belongs to a special class of domains in the plane, namely, domains for which the boundary $\partialΩ$ is contained in $\{z:|z|^2 = f(z) + \overline{f(z)}\},$ where $f'(z)$ is a rational function. We furnish examples of domains where this bound is attained. We also prove a bound on the number of critical points in the case when $Ω$ is a quadrature domain, and conclude the note by stating some open problems and conjectures.

math.CV

Random Bernstein-Markov factors

For a polynomial $P_n$ of degree $n$, Bernstein's inequality states that $\|P_n'\| \le n \|P_n\|$ for all $L^p$ norms on the unit circle, $0<p\le\infty,$ with equality for $P_n(z)= c z^n.$ We study this inequality for random polynomials, and show that the expected (average) and almost sure value of $\Vert P_n' \Vert/\Vert P_n\Vert$ is often different from the classical deterministic upper bound $n$. In particular, for circles of radii less than one, the ratio $\Vert P_n' \Vert/\Vert P_n\Vert$ is almost surely bounded as $n$ tends to infinity, and its expected value is uniformly bounded for all degrees under mild assumptions on the random coefficients. For norms on the unit circle, Borwein and Lockhart mentioned that the asymptotic value of $\Vert P_n' \Vert/\Vert P_n\Vert$ in probability is $n/\sqrt{3},$ and we strengthen this to almost sure limit for $p=2.$ If the radius $R$ of the circle is larger than one, then the asymptotic value of $\Vert P_n' \Vert/\Vert P_n\Vert$ in probability is $n/R$, matching the sharp upper bound for the deterministic case. We also obtain bounds for the case $p=\infty$ on the unit circle.

math.CV

Natural boundary and zero distribution of random polynomials in smooth domains

We consider the zero distribution of random polynomials of the form $P_n(z) = \sum_{k=0}^n a_k B_k(z)$, where $\{a_k\}_{k=0}^{\infty}$ are non-trivial i.i.d. complex random variables with mean $0$ and finite variance. Polynomials $\{B_k\}_{k=0}^{\infty}$ are selected from a standard basis such as Szegő, Bergman, or Faber polynomials associated with a Jordan domain $G$ whose boundary is $C^{2, α}$ smooth. We show that the zero counting measures of $P_n$ converge almost surely to the equilibrium measure on the boundary of $G$. We also show that if $\{a_k\}_{k=0}^{\infty}$ are i.i.d. random variables, and the domain $G$ has analytic boundary, then for a random series of the form $f(z) =\sum_{k=0}^{\infty}a_k B_k(z),$ $\partial{G}$ is almost surely a natural boundary for $f(z).$

math.PR

Harnack inequality for non-local Schrödinger operators

Let $x \in \mathbb{R}^d$, $d \geq 3,$ and $f: \mathbb{R}^d \rightarrow \mathbb{R}$ be a twice differentiable function with all second partial derivatives being continuous. For $1\leq i,j \leq d$, let $a_{ij} : \mathbb{R}^d \rightarrow \mathbb{R}$ be a differentiable function with all partial derivatives being continuous and bounded. We shall consider the Schrödinger operator associated to \begin{eqnarray*} \mathcal{L}f(x) &=& \frac12 \sum_{i=1}^d \sum_{j=1}^d \frac{\partial}{\partial x_i} \left(a_{ij}(\cdot) \frac{\partial f}{\partial x_j}\right)(x) + \int_{\mathbb{R}^d\setminus{\{0\}}} [f(y) - f(x) ]J(x,y)dy. \end{eqnarray*} where $J: \mathbb{R}^d \times \mathbb{R}^d \rightarrow \mathbb{R}$ is a symmetric measurable function. Let $q: \mathbb{R}^d \rightarrow \mathbb{R}.$ We specify assumptions on $a,q,$ and $J$ so that non-negative bounded solutions to $${\mathcal L}f + qf = 0$$ satisfy a Harnack inequality. As tools we also prove a Carleson estimate, a Uniform Boundary Harnack Principle and a 3G inequality for solutions to ${\mathcal L}f = 0.$

math.PR

The arc length of a random lemniscate

A polynomial lemniscate is a curve in the complex plane defined by $\{z \in \mathbb{C}:|p(z)|=t\}$. Erdös, Herzog, and Piranian posed the extremal problem of determining the maximum length of a lemniscate $Λ=\{ z \in \mathbb{C}:|p(z)|=1\}$ when $p$ is a monic polynomial of degree $n$. In this paper, we study the length and topology of a random lemniscate whose defining polynomial has independent Gaussian coefficients. In the special case of the Kac ensemble we show that the length approaches a nonzero constant as $n \rightarrow \infty$. We also show that the average number of connected components is asymptotically $n$, and we observe a positive probability (independent of $n$) of a giant component occurring.

math.PR

Equidistribution of zeros of random polynomials

We study the asymptotic distribution of zeros for the random polynomials $P_n(z) = \sum_{k=0}^n A_k B_k(z)$, where $\{A_k\}_{k=0}^{\infty}$ are non-trivial i.i.d. complex random variables. Polynomials $\{B_k\}_{k=0}^{\infty}$ are deterministic, and are selected from a standard basis such as Szegő, Bergman, or Faber polynomials associated with a Jordan domain $G$ bounded by an analytic curve. We show that the zero counting measures of $P_n$ converge almost surely to the equilibrium measure on the boundary of $G$ if and only if $\mathbb{E}[\log^+|A_0|]<\infty$.

math.CV

Electrostatic skeletons

Let u be the equilibrium potential of a compact set K. An electrostatic skeleton of K is a positive measure whose closed support has connected complement and no interior, and whose potential is equal to u near infinity. We prove the existence of an electrostatic skeleton for any simplex.

math.AP