Christandl, Matthias ;
Fawzi, Omar ;
Ta, Hoang ;
Zuiddam, Jeroen
Larger CornerFree Sets from Combinatorial Degenerations
Abstract
There is a large and important collection of Ramseytype combinatorial problems, closely related to central problems in complexity theory, that can be formulated in terms of the asymptotic growth of the size of the maximum independent sets in powers of a fixed small hypergraph, also called the Shannon capacity. An important instance of this is the corner problem studied in the context of multiparty communication complexity in the Number On the Forehead (NOF) model. Versions of this problem and the NOF connection have seen much interest (and progress) in recent works of Linial, Pitassi and Shraibman (ITCS 2019) and Linial and Shraibman (CCC 2021).
We introduce and study a general algebraic method for lower bounding the Shannon capacity of directed hypergraphs via combinatorial degenerations, a combinatorial kind of "approximation" of subgraphs that originates from the study of matrix multiplication in algebraic complexity theory (and which play an important role there) but which we use in a novel way.
Using the combinatorial degeneration method, we make progress on the corner problem by explicitly constructing a cornerfree subset in F₂ⁿ × F₂ⁿ of size Ω(3.39ⁿ/poly(n)), which improves the previous lower bound Ω(2.82ⁿ) of Linial, Pitassi and Shraibman (ITCS 2019) and which gets us closer to the best upper bound 4^{n  o(n)}. Our new construction of cornerfree sets implies an improved NOF protocol for the Eval problem. In the Eval problem over a group G, three players need to determine whether their inputs x₁, x₂, x₃ ∈ G sum to zero. We find that the NOF communication complexity of the Eval problem over F₂ⁿ is at most 0.24n + 𝒪(log n), which improves the previous upper bound 0.5n + 𝒪(log n).
BibTeX  Entry
@InProceedings{christandl_et_al:LIPIcs.ITCS.2022.48,
author = {Christandl, Matthias and Fawzi, Omar and Ta, Hoang and Zuiddam, Jeroen},
title = {{Larger CornerFree Sets from Combinatorial Degenerations}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {48:148:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959772174},
ISSN = {18688969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15644},
URN = {urn:nbn:de:0030drops156441},
doi = {10.4230/LIPIcs.ITCS.2022.48},
annote = {Keywords: Cornerfree sets, communication complexity, number on the forehead, combinatorial degeneration, hypergraphs, Shannon capacity, eval problem}
}
25.01.2022
Keywords: 

Cornerfree sets, communication complexity, number on the forehead, combinatorial degeneration, hypergraphs, Shannon capacity, eval problem 
Seminar: 

13th Innovations in Theoretical Computer Science Conference (ITCS 2022)

Issue date: 

2022 
Date of publication: 

25.01.2022 