2000 character limit reached
Covering all but the low weight vertices of the unit cube
Published 31 Mar 2023 in math.CO | (2303.18218v1)
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 $n$-dimensional unit cube, except those of weight at most $r$ then you need an algebraic surface of degree at least $n-r$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.