On various restricted sumsets (Q2569013): Difference between revisions

For finite subsets \(A_1,A_2,...,A_n\) of a field, their sumset is given by \(\{a_1+a_2+...+a_n: a_i\in A_i\}\). The paper studies lower bounds for the cardinality of a sumset under various restrictions. The Combinatorial Nullstellensatz from \textit{N. Alon} and \textit{Tarsi} [Combinatorica 9, 393--395 (1989; Zbl 0920.05026)], \textit{N. Alon} [Combin. Comput. Prob. 8, 7--29 (1999; Zbl 1047.11019); Isr. J. Math. 117, 125--130 (2000; Zbl 0717.05021)] and its consequences in \textit{N. Alon, M. B. Nathanson} and \textit{I. Ruzsa} [Am. Math. Mon. 102, 250--255 (1995; Zbl 0849.11081) and J. Number Theory 56, 404--417 (1996, Zbl 0861.11006)] set lower bounds for the cardinality of a sumset if a certain term in a multivariate polynomial is not vanishing. Then the paper moves on to evaluate coefficients in specific polynomials in order to prove the main results. Some related results about coefficients of polynomials have been studied before in combinatorics, see ``Dyson's conjecture'', proved by \textit{D. Zeilberger} [Discrete Math. 41, 317--321 (1982; Zbl 0492.05007)].