Restricted sums of sets of cardinality in
arXiv:2410.00143
Abstract
Let be a set of size for prime . In this paper, we prove that has cardinality at least . This result is the first advancement in over two decades on a variant of the Erdős-Heilbronn problem studied by Eliahou and Kervaire.
20 pages, submitted., Topic of a talk given at QTMC2025