L-balancing families
Abstract
P. Hrube s, S. Natarajan Ramamoorthy, A. Rao and A. Yehudayoff proved the following result: Let p be a prime and let f∈ F p[x1,…,x2p] be a polynomial. Suppose that f(vF)=0 for each F⊂eq [2p], where |F|=p and that f(0)≠ 0. Then deg(f)≥ p. We prove here the following generalization of their result. Let p be a prime and q=pα>1, α≥ 1. Let n>0 be a positive integer and q-1≤ d≤ n-q+1 be an integer. Let F be a field of characteristic p. Suppose that f(vF)=0 for each F⊂eq [n], where |F|=d and deg(f)≤ q-1. Then f(vF)=0 for each F⊂eq [n], where |F| d (mod q). Let t=2d be an even number and L⊂eq [d-1] be a given subset. We say that F⊂eq 2[t] is an L-balancing family if for each F⊂eq [t], where |F|=d there exists a G⊂eq [n] such that |F G|∈ L. We give a general upper bound for the size of an L-balancing family.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.