Abstract
P. Hrubeš, S. Natarajan Ramamoorthy, A. Rao and A. Yehudayoff [9] 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 \( \deg (f)\geq p\).
We prove here a generalization of their result for modulo q complete families, where q is a prime power. Let t=2d be an even number and \(L\subseteq [d-1]\) be a given subset. We say that \(\mathcal{F} \subseteq 2^{[t]}\) is an L-balancing family if for each \(F\subseteq [2p]\), where \(|F|=d\) there exists a \(G\subseteq [n]\) such that \(|F\cap G|\in L\).
We give an upper bound for the size of an L-balancing family in the special case if d is a prime.
Similar content being viewed by others
References
N. Alon, Problems and results in Extremal Combinatorics–IV, arXiv:2009.12692 (2020).
N. Alon, E. E. Bergmann, D. Coppersmith and A. M. Odlyzko, Balancing sets of vectors, IEEE Trans. Inform. Theory, 34 (1988), 128–130.
N. Alon, M. Kumar and B. L. Volk, Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits, Combinatorica, 40 (2020), 149–178.
D. Cox, J. Little, and D. O’Shea, Ideals, Varieties, and Algorithms, Springer-Verlag (Berlin, Heidelberg, 1992).
B. Felszeghy, G. Hegedüs and L. Rónyai, Algebraic properties of modulo q complete \(\ell\)-wide families, Comb. Probab. Comput., 18 (2009), 309–333.
H. Enomoto, P. Frankl, N. Ito and K. Nomura, Codes with given distances Graphs Combin., 3 (1987), 25–38.
G. Hegedüs, Balancing sets of vectors, Studia Sci. Math. Hungar., 47 (2010), 333–349.
G. Hegedüs, L. Rónyai, Gröbner bases for complete uniform families, J. Algebraic Combin. 17 (2003), 171–180.
P. Hrubeš, S. Natarajan Ramamoorthy, A. Rao and A. Yehudayoff, Lower bounds on balancing sets and depth-2 threshold circuits, in: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Schloss Dagstuhl. Leibniz-Zent. Inform. (Wadern, 2019), Art. No. 72, 14 pp.
S. Srinivasan, A robust version of Hegedüs’s lemma, with applications, in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, ACM (New York, 2020), pp. 1349-1362.
R. M. Wilson, A diagonal form for the incidence matrices of t-subsets vs. k-subsets, Europ. J. Combin., 11 (1990), 609–615.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hegedüs, G. L-balancing families. Acta Math. Hungar. 166, 65–69 (2022). https://doi.org/10.1007/s10474-022-01210-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10474-022-01210-9