Subset sums in p
H. H. Nguyen, E. Szemeredi, V. H. Vu
Abstract
Let p be the finite field of prime order p and A be a subset of p. We prove several sharp results about the following two basic questions: (1) When can one represent zero as a sum of distinct elements of A ? (2) When can one represent every element of p as a sum of distinct elements of A ?
Create a lesson
Related papers
On Unavoidable Faces of High-Dimensional Polytopes
Jesús A. De Loera, Ethan X. Fang, Shengtao Guo et al.
Graphs with Long Pseudosimilarity Chains under Consecutive Vertex Deletions
Sergey Ivanov
List coloring C3-free planar graphs with a sparse matching of restricted lists
Stephen G. Hartke, Yupei Li, Joseph Pappe et al.
On the gonality of Kneser graphs
Luis A. Ballinas, Willoughby Caine, D. Blake Hopkins et al.
Localization of the Caro-Wei bound and its applications to bipartiteness
Aida Abiad, Hitesh Kumar, Shivaramakrishna Pragada
Varieties of chain complexes and mixed dimer covers
Portia X. Anderson, Esther Banaian, Melanie J. Ferreri et al.