@inproceedings{7fd48fd217724672bc53269d44fff6b3,
title = "Swap Cosystolic Expansion",
abstract = "We introduce and study swap cosystolic expansion, a new expansion property of simplicial complexes. We prove lower bounds for swap coboundary expansion of spherical buildings and use them to lower bound swap cosystolic expansion of the LSV Ramanujan complexes. Our motivation is the recent work (in a companion paper) showing that swap cosystolic expansion implies agreement theorems. Together the two works show that these complexes support agreement tests in the low acceptance regime. We also study the closely related swap coboundary expansion. Swap cosystolic expansion is defined by considering, for a given complex X, its faces complex , whose vertices are r-faces of X and where two vertices are connected if their disjoint union is also a face in X. The faces complex is a derandomization of the product of X with itself r times. The graph underlying is the swap walk of X, known to have excellent spectral expansion. The swap cosystolic expansion of X is defined to be the cosystolic expansion of . Our main result is a exp(-O(√r)) lower bound on the swap coboundary expansion of the spherical building and the swap cosystolic expansion of the LSV complexes. For more general coboundary expanders we show a weaker lower bound of exp(-O(r)).",
keywords = "Coboundary Expansion, Cocycle Expanders, Cosystolic Expanders, Covers, HDX, High Dimensional Expanders",
author = "Yotam Dikstein and Irit Dinur",
note = "Publisher Copyright: {\textcopyright} 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.; 56th Annual ACM Symposium on Theory of Computing, STOC 2024 ; Conference date: 24-06-2024 Through 28-06-2024",
year = "2024",
month = jun,
day = "10",
doi = "10.1145/3618260.3649780",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
pages = "1956--1966",
editor = "Bojan Mohar and Igor Shinkar and Ryan O�Donnell",
booktitle = "STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing",
}