Related papers: A Remark on Recent Lower Bounds for Nodal Sets
We use layer potential to establish that the boundary biharmonic Steklov operators are elliptic pseudo-differential operators. Thus we are able to establish lower bounds on both the measure of boundary nodal sets and interior nodal sets for…
We address the upper bound on the size of the nodal set for a solution $w$ of the Schr\"odinger equation $\Delta w= W\cdot \nabla w+V w$ in an open set in $\mathbb{R}^n$, where the coefficients belong to certain Sobolev spaces. Assuming a…
We estimate the volume of superlevel sets of Laplace-Beltrami eigenfunctions on a compact Riemannian manifold. The proof uses the Green's function representation and the Bathtub principle. As an application, we obtain upper bounds on the…
Let $X$ be a normal projective variety of dimension $d$, and let $f$ be a zero-entropy automorphism of $X$. Denote by $k$ the first-degree growth rate of $f$, so that $\deg_1(f^n) \asymp n^{k}$. We prove the sharp lower bound for the…
We study a variant of the Alt, Caffarelli, and Friedman free boundary problem with many phases and a slightly different volume term, which we originally designed to guess the localization of eigenfunctions of a Schr\"odinger operator in a…
This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive improved upper and lower bounds based on the entropy of a…
In this paper an explicit formula for a lower bound on the volume of a hyperbolic orbifold, dependent on dimension and the maximal order of torsion in the orbifolds' fundamental group, is constructed.
We survey recent results related to the concentration of eigenfunctions. We also prove some new results concerning ball-concentration, as well as showing that eigenfunctions saturating lower bounds for $L^1$-norms must also, in a measure…
This paper proves that in a non-elementary relatively hyperbolic group, the logarithm growth rate of any non-elementary subgroup has a linear lower bound by the logarithm of the size of the corresponding generating set. As a consequence,…
Urschel introduced a notion of nodal partitioning to prove an upper bound on the number of nodal decomposition of discrete Laplacian eigenvectors. The result is an analogue to the well-known Courant's nodal domain theorem on continuous…
We introduce a simple method for proving lower bounds for the size of the smallest percolating set in a certain graph bootstrap process. We apply this method to determine the sizes of the smallest percolating sets in multidimensional tori…
We study convergence of generalized Orlicz energies when the lower growth-rate tends to infinity. We generalize results by Bocea--Mih\u{a}ilescu (Orlicz case) and Eleuteri--Prinari (variable exponent case) and allow weaker assumptions: we…
We study the relationship between $L^\infty$ growth of eigenfunctions and their $L^2$ concentration as measured by defect measures. In particular, we characterize the defect measures of any sequence of eigenfunctions with maximal $L^\infty$…
We give a general method for constructing examples of transcendental entire functions of given small order, which allows precise control over the size and shape of the set where the minimum modulus of the function is relatively large. Our…
New numerical methods have been applied in relativity to obtain a numerical evolution of Einstein equations much more robust and stable. Starting from 3+1 formalism and with the evolution equations written as a FOFCH (first-order flux…
Regularity results for minimal configurations of variational problems involving both bulk and surface energies and subject to a volume constraint are established. The bulk energies are convex functions with p-power growth, but are otherwise…
We survey a few concentration inequalities for submodular and fractionally subadditive functions of independent random variables, implied by the entropy method for self-bounding functions. The power of these concentration bounds is that…
We consider Robinson-Schensted-Knuth algorithm applied to a random input and study the growth of the bottom rows of the corresponding Young diagrams. We prove multidimensional Poisson limit theorem for the resulting Plancherel growth…
We prove a lower bound on the sharp Poincar\'e-Sobolev embedding constants for general open sets, in terms of their inradius. We consider the following two situations: planar sets with given topology; open sets in any dimension, under the…
We provide upper bounds for logarithmic torsion homology growth and Betti number growth of groups, phrased in the language of measured group theory.