English

Garland's Technique for Posets and High Dimensional Grassmannian Expanders

Combinatorics 2022-09-14 v3 Computational Complexity

Abstract

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 dimensional expansion notions and many recent expansion results have a generalization to posets. Examples are fast convergence of high dimensional random walks generalizing [KO,AL], an equivalence with a global random walk definition, generalizing [DDFH] and a trickling down theorem, generalizing [O]. In particular, we show that some posets, such as the Grassmannian poset, exhibit qualitatively stronger trickling down effect than simplicial complexes. Using these methods, and the novel idea of Posetification, to Ramanujan complexes [LSV1,LSV2], we construct a constant degree expanding Grassmannian poset, and analyze its expansion. This it the first construction of such object, whose existence was conjectured in [DDFH].

Keywords

Cite

@article{arxiv.2101.12621,
  title  = {Garland's Technique for Posets and High Dimensional Grassmannian Expanders},
  author = {Tali Kaufman and Ran J. Tessler},
  journal= {arXiv preprint arXiv:2101.12621},
  year   = {2022}
}

Comments

Changed the title; Changed some notations; Simplified the notion of 2-skeleton regularity and modified the proof of Lemma 5.4 to be compatible with the simplification