{"title":"关于阿贝尔群中的唯一和","authors":"Benjamin Bedert","doi":"10.1007/s00493-023-00069-w","DOIUrl":null,"url":null,"abstract":"<p>Let <i>A</i> be a subset of the cyclic group <span>\\({\\textbf{Z}}/p{\\textbf{Z}}\\)</span> with <i>p</i> prime. It is a well-studied problem to determine how small |<i>A</i>| can be if there is no unique sum in <span>\\(A+A\\)</span>, meaning that for every two elements <span>\\(a_1,a_2\\in A\\)</span>, there exist <span>\\(a_1',a_2'\\in A\\)</span> such that <span>\\(a_1+a_2=a_1'+a_2'\\)</span> and <span>\\(\\{a_1,a_2\\}\\ne \\{a_1',a_2'\\}\\)</span>. Let <i>m</i>(<i>p</i>) be the size of a smallest subset of <span>\\({\\textbf{Z}}/p{\\textbf{Z}}\\)</span> with no unique sum. The previous best known bounds are <span>\\(\\log p \\ll m(p)\\ll \\sqrt{p}\\)</span>. In this paper we improve both the upper and lower bounds to <span>\\(\\omega (p)\\log p \\leqslant m(p)\\ll (\\log p)^2\\)</span> for some function <span>\\(\\omega (p)\\)</span> which tends to infinity as <span>\\(p\\rightarrow \\infty \\)</span>. In particular, this shows that for any <span>\\(B\\subset {\\textbf{Z}}/p{\\textbf{Z}}\\)</span> of size <span>\\(|B|<\\omega (p)\\log p\\)</span>, its sumset <span>\\(B+B\\)</span> 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.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"11 16","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Unique Sums in Abelian Groups\",\"authors\":\"Benjamin Bedert\",\"doi\":\"10.1007/s00493-023-00069-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Let <i>A</i> be a subset of the cyclic group <span>\\\\({\\\\textbf{Z}}/p{\\\\textbf{Z}}\\\\)</span> with <i>p</i> prime. It is a well-studied problem to determine how small |<i>A</i>| can be if there is no unique sum in <span>\\\\(A+A\\\\)</span>, meaning that for every two elements <span>\\\\(a_1,a_2\\\\in A\\\\)</span>, there exist <span>\\\\(a_1',a_2'\\\\in A\\\\)</span> such that <span>\\\\(a_1+a_2=a_1'+a_2'\\\\)</span> and <span>\\\\(\\\\{a_1,a_2\\\\}\\\\ne \\\\{a_1',a_2'\\\\}\\\\)</span>. Let <i>m</i>(<i>p</i>) be the size of a smallest subset of <span>\\\\({\\\\textbf{Z}}/p{\\\\textbf{Z}}\\\\)</span> with no unique sum. The previous best known bounds are <span>\\\\(\\\\log p \\\\ll m(p)\\\\ll \\\\sqrt{p}\\\\)</span>. In this paper we improve both the upper and lower bounds to <span>\\\\(\\\\omega (p)\\\\log p \\\\leqslant m(p)\\\\ll (\\\\log p)^2\\\\)</span> for some function <span>\\\\(\\\\omega (p)\\\\)</span> which tends to infinity as <span>\\\\(p\\\\rightarrow \\\\infty \\\\)</span>. In particular, this shows that for any <span>\\\\(B\\\\subset {\\\\textbf{Z}}/p{\\\\textbf{Z}}\\\\)</span> of size <span>\\\\(|B|<\\\\omega (p)\\\\log p\\\\)</span>, its sumset <span>\\\\(B+B\\\\)</span> 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.</p>\",\"PeriodicalId\":50666,\"journal\":{\"name\":\"Combinatorica\",\"volume\":\"11 16\",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Combinatorica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00493-023-00069-w\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00493-023-00069-w","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
Let A be a subset of the cyclic group \({\textbf{Z}}/p{\textbf{Z}}\) with p prime. It is a well-studied problem to determine how small |A| can be if there is no unique sum in \(A+A\), meaning that for every two elements \(a_1,a_2\in A\), there exist \(a_1',a_2'\in A\) such that \(a_1+a_2=a_1'+a_2'\) and \(\{a_1,a_2\}\ne \{a_1',a_2'\}\). Let m(p) be the size of a smallest subset of \({\textbf{Z}}/p{\textbf{Z}}\) with no unique sum. The previous best known bounds are \(\log p \ll m(p)\ll \sqrt{p}\). In this paper we improve both the upper and lower bounds to \(\omega (p)\log p \leqslant m(p)\ll (\log p)^2\) for some function \(\omega (p)\) which tends to infinity as \(p\rightarrow \infty \). In particular, this shows that for any \(B\subset {\textbf{Z}}/p{\textbf{Z}}\) of size \(|B|<\omega (p)\log p\), its sumset \(B+B\) 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.
期刊介绍:
COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are
- Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups).
- Combinatorial optimization.
- Combinatorial aspects of geometry and number theory.
- Algorithms in combinatorics and related fields.
- Computational complexity theory.
- Randomization and explicit construction in combinatorics and algorithms.