Related papers: An interesting spectral gap problem, from Jim Fill
In this brief paper we present some results on creating and manipulating spectral gaps for a (regular) quantum graph by inserting appropriate internal structures into its vertices. Complete proofs and extensions of the results are planned…
The aim of this short note is to clarify some of the claims made in the comparison made in [S. Lloyd, On the uncomputability of the spectral gap, arXiv:1602.05924] between our recent result [T.S. Cubitt, D. Perez-Garcia, M.M. Wolf,…
This supplement documents the intellectual trajectory that led to the Category Mistake framework and the Forward-In-Time-Only (FITO) analysis presented in our recent arXiv papers. The ideas crystallized over fifteen years of research,…
We study the adjacent-transposition chain on the symmetric group $\mathfrak{S}_n$ with a regular parameter vector $\vec{p} = (p_{i,j})_{i\neq j}$. Fill's spectral gap conjecture, recently resolved in the affirmative by Greaves-Zhu, states…
We prove a uniform spectral gap for complex transfer operators near the critical line associated to overlapping $C^2$ iterated function systems on the real line satisfying a Uniform Non-Integrability (UNI) condition. Our work extends that…
In this paper, we study the problem of scattering by several strictly convex obstacles, with smooth boundary and satisfying a non eclipse condition. We show, in dimension 2 only, the existence of a spectral gap for the meromorphic…
The statistics community, which has traditionally lacked a transparent and open peer-review system, faces a challenge of inconsistent paper quality, with some published work containing substantial errors. This problem resonates with…
The paper is concerned with the number of open gaps in spectra of periodic quantum graphs. The well-known conjecture by Bethe and Sommerfeld (1933) says that the number of open spectral gaps for a system periodic in more than one direction…
The said paper [2] entitled "Proof Of Two Dimensional Jacobian Conjecture" is with gaps.
In 1952, Heinrich Scholz published a question in the Journal of Symbolic Logic asking for a characterization of spectra, i.e., sets of natural numbers that are the cardinalities of finite models of first order sentences. G\"unter Asser…
In these notes we describe heuristics to predict computational-to-statistical gaps in certain statistical problems. These are regimes in which the underlying statistical problem is information-theoretically possible although no efficient…
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…
The three gap theorem was originally a conjecture by Steinhaus, who asserted that there are at most three distinct gap lengths in the fractional parts of the sequence {\alpha},{2}{\alpha},{\cdots},{N}{\alpha} for any integer {N} and real…
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…
We prove a spectral gap inequality for the stochastic exchange model studied by Gaspard and Gilbert and by Grigo, Khanin and Sz\'asz in connection with understanding heat conduction in a deterministic billiards model. The bound on the…
Inference problems with conjectured statistical-computational gaps are ubiquitous throughout modern statistics, computer science and statistical physics. While there has been success evidencing these gaps from the failure of restricted…
We present a method for bounding, and in some cases computing, the spectral gap for systems of many particles evolving under the influence of a random collision mechanism. In particular, the method yields the exact spectral gap in a model…
We study an online learning framework introduced by Mannor and Shamir (2011) in which the feedback is specified by a graph, in a setting where the graph may vary from round to round and is \emph{never fully revealed} to the learner. We show…
We obtain an essential spectral gap for $n$-dimensional convex co-compact hyperbolic manifolds with the dimension $\delta$ of the limit set close to $(n-1)/2$. The size of the gap is expressed using the additive energy of stereographic…
Motivated by the intriguing behavior displayed in a dynamic network that models a population of extreme introverts and extroverts (XIE), we consider the spectral properties of ensembles of random split graph adjacency matrices. We discover…