Related papers: From Grassmannian to Simplicial High-Dimensional E…
We present two new explicit constructions of Cayley high dimensional expanders (HDXs) over the abelian group $\mathbb{F}_2^n$. Our expansion proofs use only linear algebra and combinatorial arguments. The first construction gives local…
We present a new construction of high dimensional expanders based on covering spaces of simplicial complexes. High dimensional expanders (HDXs) are hypergraph analogues of expander graphs. They have many uses in theoretical computer…
High dimensional expanders simultaneously satisfying spectral and combinatorial (coboundary) expansion have recently played a major role in breakthroughs in PCP and coding theory, but the only known construction of such complexes is…
In this article an explicit method (relying on representation theory) to construct packings in Grassmannian space is presented. Infinite families of configurations having only one non-trivial set of principal angles are found using…
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…
High-dimensional expanders are a generalization of the notion of expander graphs to simplicial complexes and give rise to a variety of applications in computer science and other fields. We provide a general tool to construct families of…
Recent major results in property testing~\cite{BLM24,DDL24} and PCPs~\cite{BMV24} were unlocked by moving to high-dimensional expanders (HDXs) constructed from $\widetilde{C}_d$-type buildings, rather than the long-known…
Local to global machinery plays an important role in the study of simplicial complexes, since the seminal work of Garland [G] to our days. In this work we develop a local to global machinery for general posets. We show that the high…
We study high dimensional expansion beyond simplicial complexes (posets) and focus on $q$-complexes which are complexes whose basic building blocks are linear spaces. We show that the complete $q$-complex (consists of all subspaces of a…
High dimensional expanders (HDXs) are a hypergraph generalization of expander graphs. They are extensively studied in the math and TCS communities due to their many applications. Like expander graphs, HDXs are especially interesting for…
This paper introduces the notion of local spectral expansion of a simplicial complex as a possible analogue of spectral expansion defined for graphs. We show the condition of local spectral expansion has several nice implications. For…
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…
Let $\Phi$ be an irreducible root system (other than $G_2$) of rank at least $2$, let $\mathbb{F}$ be a finite field with $p = \operatorname{char} \mathbb{F} > 3$, and let $\mathrm{G}(\Phi,\mathbb{F})$ be the corresponding Chevalley group.…
For a simplicial complex X on {1,2, ..., n} we define enriched homology and cohomology modules. They are graded modules over k[x_1, ..., x_n] whose ranks are equal to the dimensions of the reduced homology and cohomology groups. We…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
We consider a multi-parameter model for randomly constructing simplicial complexes. This model interpolates between random clique complexes and Linial-Meshulam random $k$-dimensional complexes, two models that have been extensively studied.…
Cosystolic expansion is a high-dimensional generalization of the Cheeger constant for simplicial complexes. Originally, this notion was motivated by the fact that it implies the topological overlapping property, but more recently it was…
Hypercontractivity is one of the most powerful tools in Boolean function analysis. Originally studied over the discrete hypercube, recent years have seen increasing interest in extensions to settings like the $p$-biased cube, slice, or…
Expander graphs have been a focus of attention in computer science in the last four decades. In recent years a high dimensional theory of expanders is emerging. There are several possible generalizations of the theory of expansion to…
Let $\Gamma$ be a group of type $F_n$ and let $X$ be the $n$ skeleton of the universal cover of a $K(\Gamma,1)$ simplicial complex with finite $n$ skeleton. We show that if $\Gamma$ is strongly $n$-Kazhdan, then for any family of finite…