Covering all but the low weight vertices of the unit cube
Combinatorics
2023-04-03 v1
Abstract
In this paper we discuss a result similar to the polynomial version of the Alon-F\"uredi theorem. We prove that if you want to cover the vertices of the -dimensional unit cube, except those of weight at most then you need an algebraic surface of degree at least .
Cite
@article{arxiv.2303.18218,
title = {Covering all but the low weight vertices of the unit cube},
author = {Peter Sziklai and Zsuzsa Weiner},
journal= {arXiv preprint arXiv:2303.18218},
year = {2023}
}
Comments
5 pages, published