More Like this

1. Many Nodal Domains in Random Regular Graphs

   https://doi.org/10.1007/s00220-023-04709-6  

   Ganguly, Shirshendu; McKenzie, Theo; Mohanty, Sidhanth; Srivastava, Nikhil (April 2023, Communications in Mathematical Physics)

   Let G be a random d-regular graph on n vertices. We prove that for every constant a>0, with high probability every eigenvector of the adjacency matrix of G with eigenvalue sufficiently small has Omega(n/polylog(n)) nodal domains. 

   more » « less
2. Tight Bounds on the Number of Closest Pairs in Vertical Slabs

   https://doi.org/10.4230/LIPIcs.WADS.2025.8  

   Biniaz, Ahmad; Bose, Prosenjit; Chung, Chaeyoon; De_Carufel, Jean-Lou; Iacono, John; Maheshwari, Anil; Odak, Saeed; Smid, Michiel; Tóth, Csaba D (January 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik)

   Morin, Pat; Oh, Eunjin (Ed.)

   Let S be a set of n points in ℝ^d, where d ≥ 2 is a constant, and let H₁,H₂,…,H_{m+1} be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly n/m points of S are between any two successive hyperplanes. Let |A(S,m)| be the number of different closest pairs in the {(m+1) choose 2} vertical slabs that are bounded by H_i and H_j, over all 1 ≤ i < j ≤ m+1. We prove tight bounds for the largest possible value of |A(S,m)|, over all point sets of size n, and for all values of 1 ≤ m ≤ n. As a result of these bounds, we obtain, for any constant ε > 0, a data structure of size O(n), such that for any vertical query slab Q, the closest pair in the set Q ∩ S can be reported in O(n^{1/2+ε}) time. Prior to this work, no linear space data structure with sublinear query time was known. 

   more » « less
3. SQUARE-INTEGRABILITY OF THE MIRZAKHANI FUNCTION AND STATISTICS OF SIMPLE CLOSED GEODESICS ON HYPERBOLIC SURFACES

   https://doi.org/10.1017/fms.2019.49  

   ARANA-HERRERA, FRANCISCO; ATHREYA, JAYADEV S. (January 2020, Forum of Mathematics, Sigma)

   null (Ed.)

   Given integers $$g,n\geqslant 0$$ satisfying $2-2g-n<0$ , let $${\mathcal{M}}_{g,n}$$ be the moduli space of connected, oriented, complete, finite area hyperbolic surfaces of genus $$g$$ with $$n$$ cusps. We study the global behavior of the Mirzakhani function $$B:{\mathcal{M}}_{g,n}\rightarrow \mathbf{R}_{{\geqslant}0}$$ which assigns to $$X\in {\mathcal{M}}_{g,n}$$ the Thurston measure of the set of measured geodesic laminations on $$X$$ of hyperbolic length $${\leqslant}1$$ . We improve bounds of Mirzakhani describing the behavior of this function near the cusp of $${\mathcal{M}}_{g,n}$$ and deduce that $$B$$ is square-integrable with respect to the Weil–Petersson volume form. We relate this knowledge of $$B$$ to statistics of counting problems for simple closed hyperbolic geodesics. 

   more » « less
4. An upper bound for the first nonzero Steklov eigenvalue

   https://doi.org/10.1051/cocv/2024088  

   Li, Xiaolong; Wang, Kui; Wu, Haotian (January 2025, ESAIM: Control, Optimisation and Calculus of Variations)

   Let (Mⁿ,g) be a complete simply connectedn-dimensional Riemannian manifold with curvature bounds Sect_g≤ κ for κ ≤ 0 and Ric_g≥ (n− 1)KgforK≤ 0. We prove that for any bounded domain Ω ⊂Mⁿwith diameterdand Lipschitz boundary, if Ω* is a geodesic ball in the simply connected space form with constant sectional curvature κ enclosing the same volume as Ω, then σ₁(Ω) ≤Cσ₁(Ω*), where σ₁(Ω) and σ₁(Ω*) denote the first nonzero Steklov eigenvalues of Ω and Ω* respectively, andC=C(n, κ,K,d) is an explicit constant. When κ =K, we haveC= 1 and recover the Brock–Weinstock inequality, asserting that geodesic balls uniquely maximize the first nonzero Steklov eigenvalue among domains of the same volume, in Euclidean space and the hyperbolic space. 

   more » « less
5. On Courant and Pleijel theorems for sub-Riemannian Laplacians

   https://doi.org/10.5802/jep.307  

   Frank, Rupert L; Helffer, Bernard (January 2025, Journal de l’École polytechnique — Mathématiques)

   We are interested in the number of nodal domains of eigenfunctions of sub-Laplacians on sub-Riemannian manifolds. Specifically, we investigate the validity of Pleijel’s theorem, which states that, as soon as the dimension is strictly larger than $1$, the number of nodal domains of an eigenfunction corresponding to the $k$-th eigenvalue is strictly (and uniformly, in a certain sense) smaller than $k$for large  $k$. In the first part of this paper we reduce this question from the case of general sub-Riemannian manifolds to that of nilpotent groups. In the second part, we analyze in detail the case where the nilpotent group is a Heisenberg group times a Euclidean space. Along the way, we improve known bounds on the optimal constants in the Faber–Krahn and isoperimetric inequalities on these groups. 

   more » « less