About almost covering subsets of the hypercube

DOI10.1016/J.DISC.2026.115238MaRDI QIDQ7313986zbMATH OpenFDO

Authors Arijit Ghosh, Chandrima Kayal, Soumi Nandi

Publication date 13 August 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115238

Mathematics Subject Classification ID

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

Cites work

• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• Combinatorial Nullstellensatz
• Covering all but the low weight vertices of the unit cube
• Covering almost all the layers of the hypercube with multiplicities
• Covering symmetric sets of the Boolean cube by affine hyperplanes
• Covering the cube by affine hyperplanes
• On almost \(k\)-covers of hypercubes
• Polynomials that vanish to high order on most of the hypercube
• Representing Boolean functions as polynomials modulo composite numbers
• Über die Ergänzungssätze zu den allgemeinen Reciprocitätsgesetzen.

This page was built for publication: About almost covering subsets of the hypercube

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