Profile directory About Mobile apps
Log in Sign up
arXiv Math @arxiv_math@qoto.org
Follow

About almost covering subsets of the hypercube https://arxiv.org/abs/2409.10573 #mathCO #csDM

About almost covering subsets of the hypercube

Let $\mathbb{F}$ be a field, and consider the hypercube $\{ 0, 1 \}^{n}$ in $\mathbb{F}^{n}$. Sziklai and Weiner (Journal of Combinatorial Theory, Series A 2022) showed that if a polynomial $P ( X_{1}, \dots, X_{n} ) \in \mathbb{F}[ X_{1}, \dots, X_{n}]$ vanishes on every point of the hypercube $\{0,1\}^{n}$ except those with at most $r$ many ones then the degree of the polynomial will be at least $n-r$. This is a generalization of Alon and Füredi's fundamental result (European Journal of Combinatorics 1993) about polynomials vanishing on every point of the hypercube except at the origin (point with all zero coordinates). Sziklai and Weiner proved their interesting result using Möbius inversion formula and the Zeilberger method for proving binomial equalities. In this short note, we show that a stronger version of Sziklai and Weiner's result can be derived directly from Alon and Füredi's result.

arxiv.org
September 19, 2024 at 3:10 AM · · feed2toot · 0 · 0 · 0
Sign in to participate in the conversation
Qoto Mastodon

QOTO: Question Others to Teach Ourselves
An inclusive, Academic Freedom, instance
All cultures welcome.
Hate speech and harassment strictly forbidden.

Trending now

#HashtagGames0 people talking
0
#tshirtsayings0 people talking
0
#ukraine0 people talking
0

Resources

  • Terms of service
  • Privacy policy

Developers

  • Documentation
  • API

What is Mastodon?

qoto.org

  • About
  • v3.5.19-qoto

More…

  • Source code
  • Mobile apps
v3.5.19-qoto · Privacy policy