4

[2403.19388] Cosystolic Expansion of Sheaves on Posets with Applications to Good...

 1 month ago
source link: https://arxiv.org/abs/2403.19388
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
[Submitted on 28 Mar 2024]

Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query LTCs and Lifted Codes

View PDF

We study sheaves on posets, showing that cosystolic expansion of such sheaves can be derived from local expansion conditions of the sheaf and the poset (typically a high dimensional expander). When the poset at hand is a cell complex, a sheaf on it may be thought of as generalizing coefficient groups used for defining homology and cohomology, by letting the coefficient group vary along the cell complex. Previous works established local criteria for cosystolic expansion only for simplicial complexes and with respect to constant coefficients. Cosystolic expansion of sheaves is related to property testing. We use this relation and our local criterion for cosystolic expansion to give two applications to locally testable codes (LTCs).
First, we show the existence of good 2-query LTCs. These codes are related to the recent good q-query LTCs of Dinur et. al and Panteleev-Kalachev, being the formers' so-called line codes, but we get them from a new, more illuminating perspective, namely, by realizing them as cocycle codes of sheaves over posets. We then derive their good properties directly from our criterion for cosystolic expansion.
Second, we give a local criterion for a a lifted code (with some auxiliary structure) to be locally testable. This improves on a previous work of Dikstein et. al, where it was shown that one can obtain local testability of lifted codes from a mixture of local and global conditions.
Comments: This subsumes sections 1-8 of arXiv:2208.01778. Preliminary version. Final version will appear soon
Subjects: Combinatorics (math.CO); Computational Complexity (cs.CC); Information Theory (cs.IT)
Cite as: arXiv:2403.19388 [math.CO]
  (or arXiv:2403.19388v1 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2403.19388

About Joyk


Aggregate valuable and interesting links.
Joyk means Joy of geeK