Exact hyperplane covers;
Communication complexity;
Lower bounds;
LITTLEWOOD;
OFFORD;
D O I:
10.1016/j.disc.2022.113114
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We describe an explicit and simple subset of the discrete hypercube which cannot be exactly covered by fewer than exponentially many hyperplanes. The proof exploits a connection to communication complexity, and relies heavily on Razborov's lower bound for disjointness.(c) 2022 Elsevier B.V. All rights reserved.