Related papers: An interesting spectral gap problem, from Jim Fill
In our previous work "Characterization of certain homorphic geodesic cycles on Hermitian locally symmetric manifolds of the noncompact type" in "Modern methods in Complex Analysis" Annals of Math. Studies 138 (1995) 85-118, we formulated a…
We calculate the spectral gap of the Markov matrix of the totally asymmetric simple exclusion process (TASEP) on a ring of L sites with N particles. Our derivation is simple and self-contained and extends a previous calculation that was…
The secretary problem is one of the fundamental problems in online decision making; a tight competitive ratio for this problem of $1/\mathrm{e} \approx 0.368$ has been known since the 1960s. Much more recently, the study of algorithms with…
In this paper, we investigate the relationship between frame bounds and spectral gaps. By introducing the notion of \emph{essential minimum(maximal) spectral gap}, we provide a local characterization of Landau's theorem \cite{Lan67}. As an…
We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…
We present five open problems in the theory of vertex rings. They cover a variety of different areas of research where vertex rings have been, or are threatening to be, relevant. They have also been chosen because I personally find them…
This paper reviews the 1994 proof that the spectral gap of Hamiltonian quantum systems capable of universal computation is uncomputable.
We consider a simple model of partially expanding map on the torus. We study the spectrum of the Ruelle transfer operator and show that in the limit of high frequencies in the neutral direction (this is a semiclassical limit), the spectrum…
In data-parallel optimization of machine learning models, workers collaborate to improve their estimates of the model: more accurate gradients allow them to use larger learning rates and optimize faster. In the decentralized setting, in…
The three gap theorem (or Steinhaus conjecture) asserts that there are at most three distinct gap lengths in the fractional parts of the sequence $\alpha,2\alpha,\ldots,N\alpha$, for any integer $N$ and real number $\alpha$. This statement…
The growing need to manage and exploit the proliferation of online data sources is opening up new opportunities for bringing people closer to the resources they need. For instance, consider a recommendation service through which researchers…
The spectral gap of local random quantum circuits is a fundamental property that determines how close the moments of the circuit's unitaries match those of a Haar random distribution. When studying spectral gaps, it is common to bound these…
Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the…
The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $\alpha,2\alpha,\ldots, N\alpha$ take at most three distinct values. Motivated by a question of…
Fractal groups (also called self-similar groups) is the class of groups discovered by the first author in the 80-s of the last century with the purpose to solve some famous problems in mathematics, including the question raising to von…
The spectral gap of the graph Laplacian with Dirichlet boundary conditions is computed for the graphs of several communication networks at the IP-layer, which are subgraphs of the much larger global IP-layer network. We show that the…
To a unitary matrix U we associate a doubly stochastic matrix M by taking the modulus squared of each element of U. To study the connection between onset of quantum chaos on graphs and ergodicity of the underlying Markov chain, specified by…
We prove that a distance-regular graph with a dominant distance is a spectral expander. The key ingredient of the proof is a new inequality on the intersection numbers. We use the spectral gap bound to study the structure of the…
The spectral gap problem - determining whether the energy spectrum of a system has an energy gap above ground state, or if there is a continuous range of low-energy excitations - pervades quantum many-body physics. Recently, this important…
In a recent volume of Mathematics Magazine (Vol. 90, No. 3, June 2017) there is an interesting article by Seth Zimmerman, titled Detecting Deficiencies: An Optimal Group Testing Algorithm. The claim in the summary is contradictory to…