Related papers: An interesting spectral gap problem, from Jim Fill
We continue the study of the communication complexity of gap cycle counting problems. These problems have been introduced by Verbin and Yu [SODA 2011] and have found numerous applications in proving streaming lower bounds. In the noisy gap…
In this paper, we consider real and complex algebras as well as algebras over general fields. In Section 2, we revisit and prove several results on (quadratic) algebras over general fields. As an example, we demonstrate that a quadratic…
We study a semidefinite programming relaxation of the traveling salesman problem introduced by de Klerk, Pasechnik, and Sotirov [8] and show that their relaxation has an unbounded integrality gap. In particular, we give a family of…
This review paper summarizes the contents of the talk given by the author at the 8th International Congress of Chinese Mathematicians. Using examples of Schr\"odinger operators on metric graphs, it is shown that a nontrivial topology of the…
The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal independent set. We…
In their celebrated paper (arXiv:0906.1238), Caputo, Liggett and Richthammer proved Aldous' conjecture and showed that for an arbitrary finite graph, the spectral gap of the interchange process is equal to the spectral gap of the underlying…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
We describe a list of open problems in random matrix theory and the theory of integrable systems that was presented at the conference Asymptotics in Integrable Systems, Random Matrices and Random Processes and Universality, Centre de…
An important theorem about the spectral Tur\'an problem of $K_{a,b}$ was largely developed in separate papers. Recently it was completely resolved by Zhai and Lin [J. Comb. Theory, Ser. B 157 (2022) 184-215], which also confirms a…
A research problem for undergraduates and graduates is being posed as a cap for the prior antecedent regular discrete mathematics exercises. [Here cap is not necessarily CAP=Competitive Access Provider, though nevertheless ...] The object…
One of the most well-known conjectures concerning Hamiltonicity in graphs asserts that any sufficiently large connected vertex transitive graph contains a Hamilton cycle. In this form, it was first written down by Thomassen in 1978,…
We present an algorithm for reliably and systematically proving the existence of spectral gaps in Hamiltonians with quasicrystalline order, based on numerical calculations on finite domains. We apply this algorithm to prove that the…
With the increased interest in computational sciences, machine learning (ML), pattern recognition (PR) and big data, governmental agencies, academia and manufacturers are overwhelmed by the constant influx of new algorithms and techniques…
We study high order random walks in high dimensional expanders; namely, in complexes which are local spectral expanders. Recent works have studied the spectrum of high order walks and deduced fast mixing. However, the spectral gap of high…
Knowledge production is often viewed as an endogenous process in which discovery arises through the recombination of existing theories, findings, and concepts. Yet given the vast space of potential recombinations, not all are equally…
Although it is well recognized that waves propagating in periodic media have forbidden gaps in the continuous spectrum, it is still yet unknown about the minimum number and depth of periodic modulations for clear spectral formation. This…
A k-gap is a finite k-sequence of pairwise disjoint monotone families of infinite subsets of N mixed in such a way that we cannot find a partition of N such that each family is trival on one piece of the partition. We prove that, relative…
This is an expository article to accompany my two lectures at the CDM conference. I have used this an excuse to make public two sets of notes I had lying around, and also to put together a short reader's guide to some recent joint work with…
The aim of this paper is to study the spectral gap and the logarithmic Sobolev constant for continuous spin systems. A simple but general result for estimating the spectral gap of finite dimensional systems is given by Theorem 1.1, in terms…
For the one-dimensional Schr\"odinger equation, some real intervals with no eigenvalues (the spectral gaps) may be obtained rather systematically with a method proposed by H. Giacomini and A. Mouchet in 2007. The present article provides…