Let be a subset of the cyclic group with prime. It is a well-studied problem to determine how small can be if there is no unique sum in , meaning that for every two elements , there exist such that and . Let be the size of a smallest subset of with no unique sum. The previous best known bounds are . In this paper we improve both the upper and lower bounds to for some function which tends to infinity as . In particular, this shows that for any of size , its sumset contains a unique sum. We also obtain corresponding bounds on the size of the smallest subset of a general Abelian group having no unique sum.

生成讲解博客的中文版本

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