Related papers: Mixing properties and the chromatic number of Rama…
Ramanujan graphs have extremal spectral properties, which imply a remarkable combinatorial behavior. In this paper we compute the high dimensional Hodge-Laplace spectrum of Ramanujan triangle complexes, and show that it implies a…
We define and construct Ramanujan complexes. These are simplicial complexes which are higher dimensional analogues of Ramanujan graphs. They are obtained as quotients of the buildings of type $\tilde{A}_{d-1}$ associated with…
Expander graphs in general, and Ramanujan graphs in particular, have been of great interest in the last three decades with many applications in computer science, combinatorics and even pure mathematics. In these notes we describe various…
Ramanujan graphs are graphs whose spectrum is bounded optimally. Such graphs have found numerous applications in combinatorics and computer science. In recent years, a high dimensional theory has emerged. In this paper these developments…
The total Betti number of the independence complex of a graph is an intriguing graph invariant. Kalai and Meshulam have raised the question on its relation to cycles and the chromatic number of a graph, and a recent conjecture on that theme…
Let $G$ be a topological group acting on a simplicial complex $\mathcal{X}$ satisfying some mild assumptions. For example, consider a $k$-regular tree and its automorphism group, or more generally, a regular affine Bruhat-Tits building and…
This paper brings the main definitions and results from "The Ramanujan Property for Simplicial Complexes" [arXiv:1605.02664]. No proofs are given. Given a simplicial complex $\mathcal{X}$ and a group $G$ acting on $\mathcal{X}$, we define…
This paper considers a higher-dimensional generalization of the notion of Ramanujan graphs, defined by Lubotzky, Phillips, and Sarnak. Specifically the Ramanujan property is studied for cubical complexes which are uniformized by an ordered…
We discuss two combinatorical ways of generalizing the definition of expander graphs and Ramanujan graphs, to quotients of buildings of higher dimension. The two possible definitions are equivalent for affine buildings, giving the notion of…
We prove a generalization of the Expander Mixing Lemma for arbitrary (finite) simplicial complexes. The original lemma states that concentration of the Laplace spectrum of a graph implies combinatorial expansion (which is also referred to…
We present a generalization of the construction of graphs by Lubotzky, Phillips and Sarnak in their celebrated article "Ramanujan graphs". The new approach consists in using octonion algebras rather than quaternions. A key tool is the…
The behavior of a certain random growth process is analyzed on arbitrary regular and non-regular graphs. Our argument is based on the Expander Mixing Lemma, which entails that the results are strongest for Ramanujan graphs, which…
High dimensional expanders is a vibrant emerging field of study. Nevertheless, the only known construction of bounded degree high dimensional expanders is based on Ramanujan complexes, whereas one dimensional bounded degree expanders are…
Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
We show that the vanishing of certain cohomology groups of polyhedral complexes imply upper bounds on Ramsey numbers. Lovasz bounded the chromatic numbers of graphs using Hom complexes. Babson and Kozlov proved Lovasz conjecture and…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
We prove that there exist bipartite Ramanujan graphs of every degree and every number of vertices. The proof is based on analyzing the expected characteristic polynomial of a union of random perfect matchings, and involves three…
The harmonious chromatic number of a graph $G$ is the minimum number of colors that can be assigned to the vertices of $G$ in a proper way such that any two distinct edges have different color pairs. This paper gives various results on…
Ramanujan complexes were defined as high dimensional analogues of the optimal expanders, Ramanujan graphs. They were constructed as quotients of the Euclidean building (also called the affine building and the Bruhat-Tits building) of…