English

$L$-balancing families

Combinatorics 2021-05-05 v1 Commutative Algebra

Abstract

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

Keywords

Cite

@article{arxiv.2105.01526,
  title  = {$L$-balancing families},
  author = {Gábor Hegedüs},
  journal= {arXiv preprint arXiv:2105.01526},
  year   = {2021}
}
R2 v1 2026-06-24T01:46:14.220Z