Abstract
A set L of linear polynomials in variables X1, X2, ..., Xn with real coefficients is said to be an essential cover of the cube {0, 1}n if (E1) for each ν ∈ {0, 1}n, there is a p ∈ L such that p (ν) = 0; (E2) no proper subset of L satisfies (E1), that is, for every p ∈ L, there is a ν ∈ {0, 1}n such that p alone takes the value 0 on v; (E3) every variable appears (in some monomial with non-zero coefficient) in some polynomial of L. Let e(n) be the size of the smallest essential cover of {0, 1}n. In the present note we show that 1/2 (√4n+1 + 1) le; e(n) ≤ ⌈n/2⌉ + 1.
| Original language | English |
|---|---|
| Pages (from-to) | 331-338 |
| Number of pages | 8 |
| Journal | Journal of Combinatorial Theory. Series A |
| Volume | 109 |
| Issue number | 2 |
| DOIs | |
| State | Published - Feb 2005 |
Fingerprint
Dive into the research topics of 'Essential covers of the cube by hyperplanes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver