Covering symmetric sets of the Boolean cube by affine hyperplanes
Summary: \textit{N. Alon} and \textit{Z. Füredi} [Eur. J. Comb. 14, No. 2, 79--83 (1993; Zbl 0773.52011)] proved that any family of hyperplanes that covers every point of the Boolean cube \(\{0,1\}^n\) except one must contain at least \(n\) hyperplanes. We obtain two extensions of this result, in characteristic zero, for hyperplane covers of symmetric sets of the Boolean cube (subsets that are closed under permutations of coordinates), as well as for polynomial covers of weight-determined sets of strictly unimodal uniform \((SU^2)\) grids. As a central tool for solving our problems, we give a combinatorial characterization of (finite-degree) Zariski (Z-) closures of symmetric sets of the Boolean cube. In fact, we obtain a characterization that concerns, more generally, weight-determined sets of \(SU^2\) grids. However, in this generality, our characterization is not of the Z-closures but of a new variant of Z-closures defined exclusively for weight-determined sets, which coincides with the Z-closures in the Boolean cube setting, for symmetric sets. This characterization admits a linear time algorithm, and may also be of independent interest. Indeed, as further applications, we (i) give an alternate proof of a lemma by \textit{N. Alon} et al. [IEEE Trans. Inf. Theory 34, No. 1, 128--130 (1988; Zbl 0647.94018)], and (ii) characterize the certifying degrees of weight-determined sets. In the Boolean cube setting, our above characterization can also be derived using a result of \textit{A. Bernasconi} and \textit{L. Egidi} [Inf. Comput. 153, No. 1, 1--25 (1999; Zbl 1004.06013)] that determines the affine Hilbert functions of symmetric sets. However, our proof is independent of this result, works for all \(SU^2\) grids, and could be regarded as being more combinatorial. We also introduce another new variant of Z-closures to understand better the difference between the hyperplane and polynomial covering problems over uniform grids. Finally, we conclude by introducing a third variant of our covering problems and conjecturing its solution in the Boolean cube setting.
- A combinatorial proof of strict unimodality for q-binomial coefficients
- A complex-number Fourier technique for lower bounds on the mod-\(m\) degree
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- Alon's nullstellensatz for multisets
- Balancing sets of vectors
- Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression
- Combinatorial Nullstellensatz
- Covering all points except one
- Covering finite fields with cosets of subspaces
- Covering the cube by affine hyperplanes
- Essential covers of the cube by hyperplanes
- Essential positive covers of the cube
- Generalized Hamming weights for linear codes
- Generalized Hamming weights of q-ary Reed-Muller codes
- Hilbert function and complexity lower bounds for symmetric Boolean functions
- Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry
- scientific article; zbMATH DE number 3103212 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- Intersection sets in AG(n,q) and a characterization of the hyperbolic quadric in PG(3,q)
- On almost \(k\)-covers of hypercubes
- On intersection sets in Desarguesian affine spaces
- Partitions of vector spaces
- Punctured combinatorial Nullstellensätze
- Random low-degree polynomials are hard to approximate
- Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
- The blocking number of an affine space
This page was built for publication: Covering symmetric sets of the Boolean cube by affine hyperplanes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138580)
