Covering all but the low weight vertices of the unit cube

DOI10.1016/J.JCTA.2022.105671MaRDI QIDQ2084983zbMATH OpenOpenAlexWikidataFDO

Authors Zsuzsa Weiner, Peter Sziklai

Publication date 14 October 2022

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.jcta.2022.105671

zbMATH Keywords

polynomial methodunit cubeZeilberger's method

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Recommendations

• Covering the cube by affine hyperplanes
• Some extensions of Alon's Nullstellensatz
• Exact hyperplane covers for subsets of the hypercube
• On almost \(k\)-covers of hypercubes
• Covering almost all the layers of the hypercube with multiplicities

Cites work

• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• Covering the cube by affine hyperplanes

Cited in

(5)

• Covering almost all the layers of the hypercube with multiplicities
• Covering all but the low weight vertices of the unit cube
• On two-term hypergeometric recursions with free lower parameters
• Almost covers of finite sets of points
• About almost covering subsets of the hypercube

This page was built for publication: Covering all but the low weight vertices of the unit cube

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