Computational topology and the Unique Games Conjecture

03/19/2018
by   Joshua A. Grochow, et al.
0

Covering spaces of graphs have long been useful for studying expanders (as "graph lifts") and unique games (as the "label-extended graph"). In this paper we advocate for the thesis that there is a much deeper relationship between computational topology and the Unique Games Conjecture. Our starting point is Linial's 2005 observation that the only known problems whose inapproximability is equivalent to the Unique Games Conjecture - Unique Games and Max-2Lin - are instances of Maximum Section of a Covering Space on graphs. We then observe that the reduction between these two problems (Khot-Kindler-Mossel-O'Donnell, FOCS 2004; SICOMP, 2007) gives a well-defined map of covering spaces. We further prove that inapproximability for Maximum Section of a Covering Space on (cell decompositions of) closed 2-manifolds is also equivalent to the Unique Games Conjecture. This gives the first new "Unique Games-complete" problem in over a decade. Our results partially settle an open question of Chen and Freedman (SODA 2010; Disc. Comput. Geom., 2011) from computational topology, by showing that their question is almost equivalent to the Unique Games Conjecture. (The main difference is that they ask for inapproximability over Z/2Z, and we show Unique Games-completeness over Z/kZ for large k.) This equivalence comes from the fact that when the structure group G of the covering space is Abelian - or more generally for principal G-bundles - Maximum Section of a G-Covering Space is the same as the well-studied problem of 1-Homology Localization. Although our most technically demanding result is an application of Unique Games to computational topology, we hope that our observations on the topological nature of the Unique Games Conjecture will lead to applications of algebraic topology to the Unique Games Conjecture in the future.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2019

Statistical physics approaches to Unique Games

We show how two techniques from statistical physics can be adapted to so...
research
08/02/2017

A Periodic Isoperimetric Problem Related to the Unique Games Conjecture

We prove the endpoint case of a conjecture of Khot and Moshkovitz relate...
research
03/15/2021

Strong Parallel Repetition for Unique Games on Small Set Expanders

Strong Parallel Repetition for Unique Games on Small Set Expanders The...
research
10/20/2021

An Invariance Principle for the Multi-slice, with Applications

Given an alphabet size m∈ℕ thought of as a constant, and k⃗ = (k_1,…,k_m...
research
01/05/2021

Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition

This paper revisits two classical distributed problems in anonymous netw...
research
08/03/2020

Approximating Constraint Satisfaction Problems Symmetrically

This thesis investigates the extent to which the optimal value of a cons...
research
12/16/2020

Continuous Positional Payoffs

What payoffs are positional for (deterministic) two-player antagonistic ...

Please sign up or login with your details

Forgot password? Click here to reset