Covering the cube by affine hyperplanes
From MaRDI portal
Publication:1209723
DOI10.1006/eujc.1993.1011zbMath0773.52011OpenAlexW1976465342MaRDI QIDQ1209723
Publication date: 16 May 1993
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1993.1011
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)
Related Items
Graph polynomials and group coloring of graphs, Partitions of vector spaces, Warning's second theorem with relaxed outputs, On the size of coset unions, Covering symmetric sets of the Boolean cube by affine hyperplanes, Three Combinatorial Perspectives on Minimal Codes, Coverings of Abelian groups and vector spaces., Explicit exponential lower bounds for exact hyperplane covers, Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube, Alon's nullstellensatz for multisets, Essential positive covers of the cube, A refinement of Cauchy-Schwarz complexity, Covering almost all the layers of the hypercube with multiplicities, Combinatorics. Abstracts from the workshop held January 1--7, 2023, On the probabilistic degree of OR over the reals, Combinatorial Nullstellensatz over division rings, Zero-sum problems and coverings by proper cosets, Punctured combinatorial Nullstellensätze, Polynomials that vanish to high order on most of the hypercube, Depth lower bounds in Stabbing Planes for combinatorial principles, Covering point-sets with parallel hyperplanes and sparse signal recovery, An algebraic approach for counting DP-3-colorings of sparse graphs, Covering grids with multiplicity, System of unbiased representatives for a collection of bicolorings, Warning's second theorem with restricted variables, On almost \(k\)-covers of hypercubes, Intersection patterns of linear subspaces with the hypercube, On Zeros of a Polynomial in a Finite Grid, Minimum distance functions of complete intersections, On the Alon-Füredi bound, A subspace covering problem in the \(n\)-cube, Essential covers of the cube by hyperplanes, Footprint and minimum distance functions, Unification of zero-sum problems, subset sums and covers of ℤ, Unnamed Item, Resolution with counting: dag-like lower bounds and different moduli, Covering all points except one, On the next-to-minimal weight of affine Cartesian codes, Exact hyperplane covers for subsets of the hypercube, Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives, Compact quadratizations for pseudo-Boolean functions, Unnamed Item, Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes, Covering all but the low weight vertices of the unit cube
