{"title":"有限西顿集的直径","authors":"D. Carter, Z. Hunter, K. O’Bryant","doi":"10.1007/s10474-024-01499-8","DOIUrl":null,"url":null,"abstract":"<div><p>We prove that the diameter of a Sidon set (also known as a Babcock sequence, Golomb ruler, or <span>\\(B_2\\)</span> set) with <span>\\(k\\)</span> elements is at least <span>\\(k^2-b k^{3/2}-O(k)\\)</span> where <span>\\(b\\le 1.96365\\)</span>, a comparatively large improvement on past results. Equivalently, a Sidon set with diameter <span>\\(n\\)</span> has at most <span>\\(n^{1/2}+0.98183n^{1/4}+O(1)\\)</span> elements. The proof is conceptually simple but very computationally intensive, and the proof uses substantial computer assistance. We also provide a proof of <span>\\(b\\le 1.99058\\)</span> that can be verified by hand, which still improves on past results. Finally, we prove that <span>\\(g\\)</span>-thin Sidon sets (aka <span>\\(g\\)</span>-Golomb rulers) with <span>\\(k\\)</span> elements have diameter at least <span>\\(g^{-1} k^2 - (2-\\varepsilon)g^{-1}k^{3/2} - O(k)\\)</span>, with <span>\\(\\varepsilon\\ge 0.0062g^{-4}\\)</span>.</p></div>","PeriodicalId":50894,"journal":{"name":"Acta Mathematica Hungarica","volume":"175 1","pages":"108 - 126"},"PeriodicalIF":0.6000,"publicationDate":"2025-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10474-024-01499-8.pdf","citationCount":"0","resultStr":"{\"title\":\"On the diameter of finite Sidon sets\",\"authors\":\"D. Carter, Z. Hunter, K. O’Bryant\",\"doi\":\"10.1007/s10474-024-01499-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We prove that the diameter of a Sidon set (also known as a Babcock sequence, Golomb ruler, or <span>\\\\(B_2\\\\)</span> set) with <span>\\\\(k\\\\)</span> elements is at least <span>\\\\(k^2-b k^{3/2}-O(k)\\\\)</span> where <span>\\\\(b\\\\le 1.96365\\\\)</span>, a comparatively large improvement on past results. Equivalently, a Sidon set with diameter <span>\\\\(n\\\\)</span> has at most <span>\\\\(n^{1/2}+0.98183n^{1/4}+O(1)\\\\)</span> elements. The proof is conceptually simple but very computationally intensive, and the proof uses substantial computer assistance. We also provide a proof of <span>\\\\(b\\\\le 1.99058\\\\)</span> that can be verified by hand, which still improves on past results. Finally, we prove that <span>\\\\(g\\\\)</span>-thin Sidon sets (aka <span>\\\\(g\\\\)</span>-Golomb rulers) with <span>\\\\(k\\\\)</span> elements have diameter at least <span>\\\\(g^{-1} k^2 - (2-\\\\varepsilon)g^{-1}k^{3/2} - O(k)\\\\)</span>, with <span>\\\\(\\\\varepsilon\\\\ge 0.0062g^{-4}\\\\)</span>.</p></div>\",\"PeriodicalId\":50894,\"journal\":{\"name\":\"Acta Mathematica Hungarica\",\"volume\":\"175 1\",\"pages\":\"108 - 126\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2025-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s10474-024-01499-8.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Mathematica Hungarica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10474-024-01499-8\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Mathematica Hungarica","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s10474-024-01499-8","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
We prove that the diameter of a Sidon set (also known as a Babcock sequence, Golomb ruler, or \(B_2\) set) with \(k\) elements is at least \(k^2-b k^{3/2}-O(k)\) where \(b\le 1.96365\), a comparatively large improvement on past results. Equivalently, a Sidon set with diameter \(n\) has at most \(n^{1/2}+0.98183n^{1/4}+O(1)\) elements. The proof is conceptually simple but very computationally intensive, and the proof uses substantial computer assistance. We also provide a proof of \(b\le 1.99058\) that can be verified by hand, which still improves on past results. Finally, we prove that \(g\)-thin Sidon sets (aka \(g\)-Golomb rulers) with \(k\) elements have diameter at least \(g^{-1} k^2 - (2-\varepsilon)g^{-1}k^{3/2} - O(k)\), with \(\varepsilon\ge 0.0062g^{-4}\).
期刊介绍:
Acta Mathematica Hungarica is devoted to publishing research articles of top quality in all areas of pure and applied mathematics as well as in theoretical computer science. The journal is published yearly in three volumes (two issues per volume, in total 6 issues) in both print and electronic formats. Acta Mathematica Hungarica (formerly Acta Mathematica Academiae Scientiarum Hungaricae) was founded in 1950 by the Hungarian Academy of Sciences.