
Approximate Covers and Cocycle Expansion
Irit Dinur, a mathematician at the Institute for Advanced Study, gives this Computer Science/Discrete Mathematics Seminar talk on the connections between cocycles, covers, and expansion. She opens with the established relation between cocycles and covers of a space, then turns to how cocycle expansion relates to approximate covers, where a cover only agrees with itself on most of its structure rather than all of it. The talk closes by showing how this machinery appears in low-soundness PCP agreement tests, a core tool in the theory of probabilistically checkable proofs and hardness of approximation. The session runs about two hours and is pitched at a research audience already familiar with expander graphs, cohomology, and PCP constructions, building its argument through definitions and theorem sketches rather than general motivation.