Covering all but the low weight vertices of the unit cube

DOI10.1016/j.jcta.2022.105671zbMath1498.52029OpenAlexW4295364821WikidataQ114162621 ScholiaQ114162621MaRDI QIDQ2084983

Zsuzsa Weiner, Peter Sziklai

Publication date: 14 October 2022

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

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

zbMATH Keywords

unit cubepolynomial methodZeilberger's method

Mathematics Subject Classification ID

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

Cites Work

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

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