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 -partite -dimensional simplicial complex, we show that if "on average" the links of faces of co-dimension 2 are -(one-sided) spectral expanders, then the link of any face of co-dimension is an -(one-sided) spectral expander, for all . For an application, using our theorem as a black-box, we show that links of faces of co-dimension in recent constructions of bounded degree high dimensional expanders have spectral expansion at most fraction of the spectral expansion of the links of the worst faces of co-dimension $2$.
Paper Prompts
Sign up for free to create and run prompts on this paper.