Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 70 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 24 tok/s Pro
GPT-4o 75 tok/s Pro
Kimi K2 175 tok/s Pro
GPT OSS 120B 447 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

$L$-balancing families (2105.01526v1)

Published 4 May 2021 in math.CO and math.AC

Abstract: P. Hrube\v s, S. Natarajan Ramamoorthy, A. Rao and A. Yehudayoff proved the following result: Let $p$ be a prime and let $f\in \mathbb F p[x_1,\ldots,x{2p}]$ be a polynomial. Suppose that $f(\mathbf{v_F})=0$ for each $F\subseteq [2p]$, where $|F|=p$ and that $f(\mathbf{0})\neq 0$. Then $\mbox{deg}(f)\geq p$. We prove here the following generalization of their result. Let $p$ be a prime and $q=p\alpha>1$, $\alpha\geq 1$. Let $n>0$ be a positive integer and $q-1\leq d\leq n-q+1$ be an integer. Let $\mathbb F$ be a field of characteristic $p$. Suppose that $f(\mathbf{v_F})=0$ for each $F\subseteq [n]$, where $|F|=d$ and $\mbox{deg}(f)\leq q-1$. Then $f(\mathbf{v_F})=0$ for each $F\subseteq [n]$, where $|F|\equiv d \mbox{ (mod }q)$. Let $t=2d$ be an even number and $L\subseteq [d-1]$ be a given subset. We say that $\mbox{$\cal F$}\subseteq 2{[t]}$ is an {\em $L$-balancing family} if for each $F\subseteq [t]$, where $|F|=d$ there exists a $G\subseteq [n]$ such that $|F\cap G|\in L$. We give a general upper bound for the size of an $L$-balancing family.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.