Explicit exponential lower bounds for exact hyperplane covers

DOI10.1016/J.DISC.2022.113114MaRDI QIDQ2166321zbMATH OpenOpenAlexWikidataFDO

Authors Benjamin E. Diamond, Amir Yehudayoff

Publication date 24 August 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2022.113114

zbMATH Keywords

communication complexityexact hyperplane coverslower bounds

Mathematics Subject Classification ID

Designs and configurations (05Bxx) Discrete geometry (52Cxx) Theory of computing (68Qxx)

Recommendations

• Exact hyperplane covers for subsets of the hypercube
• Covering almost all the layers of the hypercube with multiplicities
• Covering the cube by affine hyperplanes
• Essential positive covers of the cube
• scientific article; zbMATH DE number 1855660

Cites work

• Communication Complexity
• Covering the cube by affine hyperplanes
• Exact hyperplane covers for subsets of the hypercube
• scientific article; zbMATH DE number 1453080 (Why is no real title available?)
• scientific article; zbMATH DE number 3099315 (Why is no real title available?)
• On a lemma of Littlewood and Offord
• On a lemma of Littlewood and Offord on the distribution of certain sums
• On the distribution of sums of residues
• On the distributional complexity of disjointness
• Solution of the Littlewood-Offord problem in high dimensions

Cited in

(1)

• Covering almost all the layers of the hypercube with multiplicities

This page was built for publication: Explicit exponential lower bounds for exact hyperplane covers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2166321)