English

An Improved Trickle-Down Theorem for Partite Complexes

Discrete Mathematics 2023-06-21 v3 Data Structures and Algorithms Combinatorics

Abstract

We prove a strengthening of the trickle down theorem for partite complexes. Given a (d+1)(d+1)-partite dd-dimensional simplicial complex, we show that if "on average" the links of faces of co-dimension 2 are 1δd\frac{1-\delta}{d}-(one-sided) spectral expanders, then the link of any face of co-dimension kk is an O(1δkδ)O(\frac{1-\delta}{k\delta})-(one-sided) spectral expander, for all 3kd+13\leq k\leq d+1. For an application, using our theorem as a black-box, we show that links of faces of co-dimension kk in recent constructions of bounded degree high dimensional expanders have spectral expansion at most O(1/k)O(1/k) fraction of the spectral expansion of the links of the worst faces of co-dimension 22.

Cite

@article{arxiv.2208.04486,
  title  = {An Improved Trickle-Down Theorem for Partite Complexes},
  author = {Dorna Abdolazimi and Shayan Oveis Gharan},
  journal= {arXiv preprint arXiv:2208.04486},
  year   = {2023}
}
R2 v1 2026-06-25T01:35:03.479Z