English
Related papers

Related papers: Small gaps in the spectrum of the rectangular bill…

200 papers

We introduce and investigate billiard systems with an adjusted ray dynamics that accounts for modifications of the conventional reflection of rays due to universal wave effects. We show that even small modifications of the specular…

Optics · Physics 2008-09-19 Eduardo G. Altmann , Gianluigi Del Magno , Martina Hentschel

We establish a sharp lower bound on the spectral gap of the biased adjacent-transposition Markov chain on the symmetric group. As a consequence, we resolve a longstanding conjecture of Fill, proving that among all regular probability…

Probability · Mathematics 2026-04-08 Gary R. W. Greaves , Haoran Zhu

In this article we investigate different forms of multiplicative independence between the sequences $n$ and $\lfloor n \alpha \rfloor$ for irrational $\alpha$. Our main theorem shows that for a large class of arithmetic functions $a, b…

Number Theory · Mathematics 2023-12-08 David Crnčević , Felipe Hernández , Kevin Rizk , Khunpob Sereesuchart , Ran Tao

In STOC'95 [ADMSS'95] Arya et al. showed that any set of $n$ points in $\mathbb R^d$ admits a $(1+\epsilon)$-spanner with hop-diameter at most 2 (respectively, 3) and $O(n \log n)$ edges (resp., $O(n \log \log n)$ edges). They also gave a…

Data Structures and Algorithms · Computer Science 2022-01-03 Hung Le , Lazar Milenkovic , Shay Solomon

We show that the complexity of the billiard in a typical polygon grows cubically and the number of saddle connections grows quadratically along certain subsequences. It is known that the set of points whose first n-bounces hits the same…

Dynamical Systems · Mathematics 2023-12-08 Tyll Krueger , Arnaldo Nogueira , Serge Troubetzkoy

Let $NPO(k)$ be the smallest number $n$ such that the adjacency matrix of any undirected graph with $n$ vertices or more has at least $k$ nonpositive eigenvalues. We show that $NPO(k)$ is well-defined and prove that the values of $NPO(k)$…

Combinatorics · Mathematics 2012-05-29 Zachary B. Charles , Miriam Farber , Charles R. Johnson , Lee Kennedy-Shaffer

For a graph $G,$ let $\alpha(G)$ denote its second smallest Laplacian eigenvalue. The Laplacian Spread Conjecture states that $\alpha(G)+\alpha(\overline{G}) \geq 1,$ where $\overline{G}$ is the complement of $G.$ In this paper, we have…

Combinatorics · Mathematics 2024-11-22 Borchen Li

We consider the spectrum of the almost Mathieu operator $H_\alpha$ with frequency $\alpha$ and in the case of the critical coupling. Let an irrational $\alpha$ be such that $|\alpha-p_n/q_n|<c q_n^{-\varkappa}$, where $p_n/q_n$,…

Spectral Theory · Mathematics 2016-11-23 I. Krasovsky

We derive several upper bounds on the spectral gap of the Laplacian with standard or Dirichlet vertex conditions on compact metric graphs. In particular, we obtain estimates based on the length of a shortest cycle (girth), diameter, total…

Spectral Theory · Mathematics 2023-04-14 Gregory Berkolaiko , James B. Kennedy , Pavel Kurasov , Delio Mugnolo

The classic graphical Cheeger inequalities state that if $M$ is an $n\times n$ symmetric doubly stochastic matrix, then \[ \frac{1-\lambda_{2}(M)}{2}\leq\phi(M)\leq\sqrt{2\cdot(1-\lambda_{2}(M))} \] where…

Combinatorics · Mathematics 2019-09-30 Jenish C. Mehta , Leonard J. Schulman

We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…

Spectral Theory · Mathematics 2019-04-03 Jiao Gu , Jürgen Jost , Shiping Liu , Peter F. Stadler

We study the problem of distinguishing between two independent samples $\mathbf{G}_n^1,\mathbf{G}_n^2$ of a binomial random graph $G(n,p)$ by first order (FO) sentences. Shelah and Spencer proved that, for a constant $\alpha\in(0,1)$,…

Combinatorics · Mathematics 2024-05-16 Tal Hershko , Maksim Zhukovskii

Let $\alpha\in(0,1)_\mathbb{R}$ be irrational and $G_n = G_{{n, 1/n}^\alpha}$ be the random graph with edge probability $1/n^\alpha$; we know that it satisfies the 0-1 law for first order logic. We deal with the failure of the 0-1 law for…

Logic · Mathematics 2017-06-06 Saharon Shelah

We consider rectangular random matrices of size $p\times n$ belonging to the real Wishart-Laguerre ensemble also known as the chiral Gaussian orthogonal ensemble. This ensemble appears in many applications like QCD, mesoscopic physics, and…

Mathematical Physics · Physics 2015-09-17 Tim Wirtz , Gernot Akemann , Thomas Guhr , Mario Kieburg , René Wegner

In this paper we show that any increasing functional of the first k eigenvalues of the Dirichlet Laplacian admits a (quasi-)open minimizer among the subsets of R^N of unit measure. In particular, there exists such a minimizer which is…

Functional Analysis · Mathematics 2011-12-02 Dario Mazzoleni , Aldo Pratelli

Part I of this series (arXiv:2602.09029) develops a sharp Gaussian (LAN/GDP) limit theory for neighboring shuffle experiments when the local randomizer is fixed and has full support bounded away from zero. The present paper characterizes…

Statistics Theory · Mathematics 2026-03-12 Alex Shvets

In this paper, we examine the level spacing distribution $P(S)$ of the rectangular billiard with a single point-like scatterer, which is known as pseudointegrable. It is shown that the observed $P(S)$ is a new type, which is quite different…

chao-dyn · Physics 2008-11-26 T. Shigehara , N. Yoshinaga , Taksu Cheon , T. Mizusaki

This paper reports the results of extensive numerical studies related to spectral properties of the Laplacian and the scattering matrix for planar domains (called billiards). There is a close connection between eigenvalues of the billiard…

Minkowski's First Theorem and Dirichlet's Approximation Theorem provide upper bounds on certain minima taken over lattice points contained in domains of Euclidean spaces. We study the distribution of such minima and show, under some…

Number Theory · Mathematics 2022-01-14 Michael Björklund , Alexander Gorodnik

We investigate the existence of a statistical-computational gap in multiple Gaussian graph alignment. We first generalize a previously established informational threshold from Vassaux and Massouli\'e (2025) to regimes where the number of…

Machine Learning · Statistics 2025-12-02 Bertrand Even , Luca Ganassali