On almost \(k\)-covers of hypercubes

DOI10.1007/s00493-019-4221-yzbMath1474.52027arXiv1904.12885OpenAlexW3021236690MaRDI QIDQ2221002

Hao Huang, Alexander Clifton

Publication date: 25 January 2021

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.12885

zbMATH Keywords

affine hyperplanes\(k\)-covers

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)

Related Items

Covering symmetric sets of the Boolean cube by affine hyperplanes ⋮ Covering almost all the layers of the hypercube with multiplicities ⋮ Polynomials that vanish to high order on most of the hypercube ⋮ Covering grids with multiplicity ⋮ Exact hyperplane covers for subsets of the hypercube

Cites Work

• Punctured combinatorial Nullstellensätze
• Covering the cube by affine hyperplanes
• Covering finite fields with cosets of subspaces
• The blocking number of an affine space
• Logarithmic order of free distributive lattice
• Combinatorial Nullstellensatz
• On generalized graphs
• A short proof of Sperner's lemma
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• Covering all points except one