Papers
Topics
Authors
Recent
Search
2000 character limit reached

An Improved Trickle-Down Theorem for Partite Complexes

Published 9 Aug 2022 in cs.DM, cs.DS, and math.CO | (2208.04486v3)

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 3≤k≤d+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 $2$.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.