For a subset of a finite abelian group , let denote the set of sums of distinct elements of , and let . The problem of determining when goes back to Erdős and Heilbronn. Nguyen and Vu later formulated the corresponding fixed-length question: for a prescribed , when does ? For groups of odd order, we prove the sharp large-order threshold , which forces throughout the entire middle range . This determines the limiting thresholds posed by Girard, Griffiths and Hamidoune. If is the least prime divisor of , then, for fixed odd and sufficiently large , the exact threshold forces covering throughout the middle range beginning at . Thus, throughout this range, prescribing the number of summands does not change the sharp covering threshold. For , the restricted and ordinary -fold covering problems have the same asymptotic threshold. As an application to MDS elliptic codes on an elliptic curve , we sharpen the half-scale conjecture of Li, Wan and Zhang, obtaining the sharp -scale bound when is odd and, more generally, the exact bound determined by the least prime divisor of .

生成讲解博客的中文版本

生成AI智能校验的中文版本