SearcharxivSearch

arXiv subjects

Alexander Logunov

Publications and source records attributed to Alexander Logunov.

At least 19 recordsLinked to original sources

Estimating the number of real zeros of linear combinations of radicals of polynomials

We obtain upper bounds for the number of real zeros of functions of the form $$ f(x) = \sum_{k=1}^{n} c_k \bigl(P_k(x)\bigr)^{\alpha_k}, $$ where $c_k, \alpha_k \in \mathbb{R}$ and each $P_k$ is a real polynomial of degree at most $d$ that is non-negative on an interval $I\subset \mathbb{R}$. We improve previously known exponential upper bounds for the number of roots on $I$ to bounds that are polynomial in $n$, linear in $d$, and independent of the exponents $\alpha_k$. For linear combinations of square roots of positive quadratic polynomials on $\mathbb{R}$ we prove the linear bound $2n$, answering a question of N.~Alon. A modification of the argument yields a linear bound for a question of A.~Gabrielov, D.~Novikov, and B.~Shapiro related to Maxwell's conjecture. The article describes two independent approaches: an elementary ODE method in the general case, which also gives a polynomial bound for the number of critical points of one dimensional Gaussian mixtures, and a PDE method for the case of positive quadratic polynomials, which connects the problem to the number of nodal domains of solutions to $\Delta u + \lambda u = 0$ on the punctured hyperbolic plane. As a byproduct of the second approach, we describe a curious relation between axially symmetric harmonic functions on $\mathbb{R}^3\setminus\{(x,0,0)\}$ and Laplace-Beltrami eigenfunctions on the hyperbolic plane with eigenvalue $1/4$.

math.CA

Nested nodal loops of biharmonic functions

Given any \(n\in\mathbb{N}\), we construct a real-valued biharmonic polynomial on \(\mathbb{R}^2\) whose zero set contains a nest of \(n\) smooth, disjoint topological loops, meaning that the \(k\)-th loop lies inside the domain bounded by the \((k+1)\)-st loop for \(k=1,\ldots,n-1\). The case \(n=2\), i.e., the existence of two nested loops, is related to the failure of the Boggio-Hadamard conjecture from the early 1900s.

math.AP

A fractal-like configuration of point-line pairs for the minimal distance problem

We show that for every $n \in \mathbb N$ there is a collection of points $p_1, \ldots, p_n$ and lines $\ell_1, \ldots, \ell_n$ in the unit square such that for any $i$ we have $p_i \in \ell_i$ and the distance from $p_i$ to any other line $\ell_j$ is at least $c n^{\gamma-1}$ for some universal constants $c, \gamma>0$. This is better than a trivial construction by a polynomial factor.

math.CO

Almost sharp lower bound for the nodal volume of harmonic functions

This paper focuses on a relation between the growth of harmonic functions and the Hausdorff measure of their zero sets. Let $u$ be a real-valued harmonic function in $\mathbb{R}^n$ with $u(0)=0$ and $n\geq 3$. We prove $$\mathcal{H}^{n-1}(\{u=0\} \cap B(0,2)) \gtrsim_{\varepsilon} N^{1-\varepsilon},$$ where the doubling index $N$ is a notion of growth defined by $$ \sup_{B(0, 1)}|u| = 2^N \sup_{B(0,\frac{1}{2})}|u|.$$ This gives an almost sharp lower bound for the Hausdorff measure of the zero set of $u$, which is conjectured to be linear in $N$. The new ingredients of the article are the notion of stable growth, and a multi-scale induction technique for a lower bound for the distribution of the doubling index of harmonic functions. It gives a significant improvement over the previous best-known bound $\mathcal{H}^{n-1}\left(\{u=0\} \cap 2B\right)\geq \exp (c \log N/\log\log N )$, which implied Nadirashvili's conjecture.

math.AP

Collapsing Superstring Conjecture

In the Shortest Common Superstring (SCS) problem, one is given a collection of strings, and needs to find a shortest string containing each of them as a substring. SCS admits $2\frac{11}{23}$-approximation in polynomial time (Mucha, SODA'13). While this algorithm and its analysis are technically involved, the 30 years old Greedy Conjecture claims that the trivial and efficient Greedy Algorithm gives a 2-approximation for SCS. We develop a graph-theoretic framework for studying approximation algorithms for SCS. The framework is reminiscent of the classical 2-approximation for Traveling Salesman: take two copies of an optimal solution, apply a trivial edge-collapsing procedure, and get an approximate solution. In this framework, we observe two surprising properties of SCS solutions, and we conjecture that they hold for all input instances. The first conjecture, that we call Collapsing Superstring conjecture, claims that there is an elementary way to transform any solution repeated twice into the same graph $G$. This conjecture would give an elementary 2-approximate algorithm for SCS. The second conjecture claims that not only the resulting graph $G$ is the same for all solutions, but that $G$ can be computed by an elementary greedy procedure called Greedy Hierarchical Algorithm. While the second conjecture clearly implies the first one, perhaps surprisingly we prove their equivalence. We support these equivalent conjectures by giving a proof for the special case where all input strings have length at most 3. We prove that the standard Greedy Conjecture implies Greedy Hierarchical Conjecture, while the latter is sufficient for an efficient greedy 2-approximate approximation of SCS. Except for its (conjectured) good approximation ratio, the Greedy Hierarchical Algorithm provably finds a 3.5-approximation.

cs.DS

Review of Yau's conjecture on zero sets of Laplace eigenfunctions

This is a review of old and new results and methods related to the Yau conjecture on the zero set of Laplace eigenfunctions. The review accompanies two lectures given at the conference CDM 2018. We discuss the works of Donnelly and Fefferman including their solution of the conjecture in the case of real-analytic Riemannian manifolds. The review exposes the new results for Yau's conjecture in the smooth setting. We try to avoid technical details and emphasize the main ideas of the proof of Nadirashvili's conjecture. We also discuss two-dimensional methods to study zero sets.

math.AP

Eigenfunctions with infinitely many isolated critical points

We construct a Riemannian metric on the $ 2 $-dimensional torus, such that for infinitely many eigenvalues of the Laplace-Beltrami operator, a corresponding eigenfunction has infinitely many isolated critical points. A minor modification of our construction implies that each of these eigenfunctions has a level set with infinitely many connected components (i.e., a linear combination of two eigenfunctions may have infinitely many nodal domains).

math.SP

Nodal sets of Laplace eigenfunctions: polynomial upper estimates of the Hausdorff measure

Let $\mathbb{M}$ be a compact $C^\infty$-smooth Riemannian manifold of dimension $n$, $n\geq 3$, and let $φ_λ: Δ_M φ_λ+ λφ_λ= 0$ denote the Laplace eigenfunction on $\mathbb{M}$ corresponding to the eigenvalue $λ$. We show that $$H^{n-1}(\{ φ_λ=0\}) \leq C λ^α,$$ where $α>1/2$ is a constant, which depends on $n$ only, and $C>0$ depends on $\mathbb{M}$ . This result is a consequence of our study of zero sets of harmonic functions on $C^\infty$-smooth Riemannian manifolds. We develop a technique of propagation of smallness for solutions of elliptic PDE that allows us to obtain local bounds from above for the volume of the nodal sets in terms of the frequency and the doubling index.

math.AP

Nodal sets of Laplace eigenfunctions: proof of Nadirashvili's conjecture and of the lower bound in Yau's conjecture

Let $u$ be a harmonic function in the unit ball $B(0,1) \subset \mathbb{R}^n$, $n \geq 3$, such that $u(0)=0$. Nadirashvili conjectured that there exists a positive constant $c$, depending on the dimension $n$ only, such that $H^{n-1}(\{u=0 \}\cap B) \geq c$. We prove Nadirashvili's conjecture as well as its counterpart on $C^\infty$-smooth Riemannian manifolds. The latter yields the lower bound in Yau's conjecture. Namely, we show that for any compact $C^\infty$-smooth Riemannian manifold $M$ (without boundary) of dimension $n$ there exists $c>0$ such that for any Laplace eigenfunction $φ_λ$ on $M$, which corresponds to the eigenvalue $λ$, the following inequality holds: $c \sqrt λ\leq H^{n-1}(\{φ_λ=0\})$.

math.AP

Nodal sets of Laplace eigenfunctions: estimates of the Hausdorff measure in dimension two and three

Let $Δ_M$ be the Laplace operator on a compact $n$-dimensional Riemannian manifold without boundary. We study the zero sets of its eigenfunctions $u:Δu + λu =0$. In dimension $n=2$ we refine the Donnelly-Fefferman estimate by showing that $H^1(\{u=0 \})\le Cλ^{3/4-β}$, $β\in (0,1/4)$. The proof employs the Donnelli-Fefferman estimate and a combinatorial argument, which also gives a lower (non-sharp) bound in dimension $n=3$: $H^2(\{u=0\})\ge cλ^α$, $α\in (0,1/2)$. The positive constants $c,C$ depend on the manifold, $α$ and $β$ are universal.

math.AP

Lecture notes on quantitative unique continuation for solutions of second order elliptic equations

In these lectures we present some useful techniques to study quantitative properties of solutions of elliptic PDEs. Our aim is to outline a proof of a recent result on propagation of smallness. The ideas are also useful in the study of the zero sets of eigenfunctions of Laplace-Beltrami operator and we discuss the connection. Some basic facts about second order elliptic PDEs in divergent form are collected in the Appendix at the end of the notes.

math.AP

Poisson Brackets of Partitions of Unity on Surfaces

Given an open cover of a closed symplectic manifold, consider all smooth partitions of unity consisting of functions supported in the covering sets. The Poisson bracket invariant of the cover measures how much the functions from such a partition of unity can become close to being Poisson commuting. We introduce a new approach to this invariant, which enables us to prove the lower bound conjectured by L. Polterovich, in dimension 2.

math.SG

A discrete harmonic function bounded on a large portion of $\mathbb{Z}^2$ is constant

An improvement of the Liouville theorem for discrete harmonic functions on $\mathbb{Z}^2$ is obtained. More precisely, we prove that there exists a positive constant $\varepsilon$ such that if $u$ is discrete harmonic on $\mathbb{Z}^2$ and for each sufficiently large square $Q$ centered at the origin $|u|\le 1$ on a $(1-\varepsilon)$ portion of $Q$ then $u$ is constant.

math.CA

Quantitative propagation of smallness for solutions of elliptic equations

Let $u$ be a solution to an elliptic equation $\text{div}(A\nabla u)=0$ with Lipschitz coefficients in $\mathbb{R}^n$. Assume $|u|$ is bounded by $1$ in the ball $B=\{|x|\leq 1\}$. We show that if $|u| < \varepsilon$ on a set $ E \subset \frac{1}{2} B$ with positive $n$-dimensional Hausdorf measure, then $$|u|\leq C\varepsilon^γ\text{ on } \frac{1}{2}B,$$ where $C>0, γ\in (0,1)$ do not depend on $u$ and depend only on $A$ and the measure of $E$. We specify the dependence on the measure of $E$ in the form of the Remez type inequality. Similar estimate holds for sets $E$ with Hausdorff dimension bigger than $n-1$. For the gradients of the solutions we show that a similar propagation of smallness holds for sets of Hausdorff dimension bigger than $n-1-c$, where $c>0$ is a small numerical constant depending on the dimension only.

math.AP

Translation-invariant probability measures on entire functions

We study non-trivial translation-invariant probability measures on the space of entire functions of one complex variable. The existence (and even an abundance) of such measures was proven by Benjamin Weiss. Answering Weiss question, we find a relatively sharp lower bound for the growth of entire functions in the support of such measures. The proof of this result consists of two independent parts: the proof of the lower bound and the construction, which yields its sharpness. Each of these parts combines various tools (both classical and new) from the theory of entire and subharmonic functions and from the ergodic theory. We also prove several companion results, which concern the decay of the tails of non-trivial translation-invariant probability measures on the space of entire functions and the growth of locally uniformly recurrent entire and meromorphic functions.

math.CV

Ratios of harmonic functions with the same zero set

We study the ratio of harmonic functions $u,v$, which have the same zero set $Z$ in the unit ball $B\subset \mathbb{R}^n$. The ratio $f=u/v$ can be extended to a real analytic nowhere vanishing function in $B$. We prove the Harnack inequality and the gradient estimate for such ratios in any dimension: for a given compact set $K\subset B$ we show that $\sup_K|f|\le C_1\inf_K|f|$ and $\sup_K\left|\nabla f\right|\le C_2 \inf_K|f|$, where $C_1$ and $C_2$ depend on $K$ and $Z$ only. In dimension two we specify the dependence of the constants on $Z$ in these inequalities by showing that only the number of nodal domains of $u$, i.e. the number of connected components of $B\setminus Z$, plays a role.

math.AP

On the higher-dimensional harmonic analog of the Levinson log log theorem

Let $M\colon (0,1) \to [e,+\infty)$ be a decreasing function such that $\int\limits_{0}^{1}\log\log M(y)dy<+\infty$. Consider the set $H_M$ of all functions $u$ harmonic in $P:=\{(x,y)\in \mathbb{R}^n: x\in \mathbb{R}^{n-1}, y\in \mathbb{R}, |x|<1, |y|<1 \}$ and satisfying $|u(x,y)| \leq M(|y|)$. We prove that $H_M$ is a normal family in $P$.

math.AP