Multiplayer Parallel Repetition Is the Same as High-Dimensional Extremal Combinatorics
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911238992166912 |
|---|---|
| author | Mittal, Kunal |
| author_facet | Mittal, Kunal |
| contents | We show equivalences between several high-dimensional problems in extremal combinatorics and parallel repetition of multiplayer (multiprover) games over large answer alphabets. This extends the forbidden-subgraph technique, previously studied by Verbitsky (Theoretical Computer Science 1996), Feige and Verbitsy (Combinatorica 2002), and Hązła , Holenstein and Rao (2016), to all $k$-player games, and establishes new connections to problems in combinatorics. We believe that these connections may help future progress in both fields. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_24910 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Multiplayer Parallel Repetition Is the Same as High-Dimensional Extremal Combinatorics Mittal, Kunal Computational Complexity Combinatorics We show equivalences between several high-dimensional problems in extremal combinatorics and parallel repetition of multiplayer (multiprover) games over large answer alphabets. This extends the forbidden-subgraph technique, previously studied by Verbitsky (Theoretical Computer Science 1996), Feige and Verbitsy (Combinatorica 2002), and Hązła , Holenstein and Rao (2016), to all $k$-player games, and establishes new connections to problems in combinatorics. We believe that these connections may help future progress in both fields. |
| title | Multiplayer Parallel Repetition Is the Same as High-Dimensional Extremal Combinatorics |
| topic | Computational Complexity Combinatorics |
| url | https://arxiv.org/abs/2510.24910 |