Sun关于多边形数和的猜想。

Kathrin Bringmann, Ben Kane
{"title":"Sun关于多边形数和的猜想。","authors":"Kathrin Bringmann,&nbsp;Ben Kane","doi":"10.1007/s44007-022-00030-1","DOIUrl":null,"url":null,"abstract":"<p><p>In this paper, we consider representations of positive integers as sums of generalized <i>m</i>-gonal numbers, which extend the formula for the number of dots needed to make up a regular <i>m</i>-gon. We mainly restrict to the case where the sums contain at most four distinct generalized <i>m</i>-gonal numbers, with the second <i>m</i>-gonal number repeated twice, the third repeated four times, and the last is repeated eight times. For a number of small choices of <i>m</i>, Sun conjectured that every positive integer may be written in this form. By obtaining explicit quantitative bounds for Fourier coefficients related to theta functions which encode the number of such representations, we verify that Sun's conjecture is true for sufficiently large positive integers. Since there are only finitely many choices of <i>m</i> appearing in Sun's conjecture, this reduces Sun's conjecture to a verification of finitely many cases. Moreover, the bound beyond which we prove that Sun's conjecture holds is explicit.</p>","PeriodicalId":74051,"journal":{"name":"La matematica","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9767307/pdf/","citationCount":"2","resultStr":"{\"title\":\"Conjectures of Sun About Sums of Polygonal Numbers.\",\"authors\":\"Kathrin Bringmann,&nbsp;Ben Kane\",\"doi\":\"10.1007/s44007-022-00030-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>In this paper, we consider representations of positive integers as sums of generalized <i>m</i>-gonal numbers, which extend the formula for the number of dots needed to make up a regular <i>m</i>-gon. We mainly restrict to the case where the sums contain at most four distinct generalized <i>m</i>-gonal numbers, with the second <i>m</i>-gonal number repeated twice, the third repeated four times, and the last is repeated eight times. For a number of small choices of <i>m</i>, Sun conjectured that every positive integer may be written in this form. By obtaining explicit quantitative bounds for Fourier coefficients related to theta functions which encode the number of such representations, we verify that Sun's conjecture is true for sufficiently large positive integers. Since there are only finitely many choices of <i>m</i> appearing in Sun's conjecture, this reduces Sun's conjecture to a verification of finitely many cases. Moreover, the bound beyond which we prove that Sun's conjecture holds is explicit.</p>\",\"PeriodicalId\":74051,\"journal\":{\"name\":\"La matematica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9767307/pdf/\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"La matematica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s44007-022-00030-1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"La matematica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s44007-022-00030-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在本文中,我们考虑正整数的表示为广义m-多边形数的和,从而推广了构成正则m-多边形所需的点数公式。我们主要限于和最多包含四个不同的广义m-棱数的情况,其中第二个m-棱数重复两次,第三个m-棱数重复四次,最后一个m-棱数重复八次。对于m的一些小选项,孙推测每个正整数都可以写成这种形式。通过获得与θ函数相关的傅里叶系数的显式定量界限,该函数编码了这种表示的数量,我们验证了Sun的猜想对于足够大的正整数是正确的。因为在Sun的猜想中只有有限多个m的选择,这将Sun的猜想简化为对有限多个情况的验证。此外,我们证明孙猜想成立的界域是明确的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Conjectures of Sun About Sums of Polygonal Numbers.

In this paper, we consider representations of positive integers as sums of generalized m-gonal numbers, which extend the formula for the number of dots needed to make up a regular m-gon. We mainly restrict to the case where the sums contain at most four distinct generalized m-gonal numbers, with the second m-gonal number repeated twice, the third repeated four times, and the last is repeated eight times. For a number of small choices of m, Sun conjectured that every positive integer may be written in this form. By obtaining explicit quantitative bounds for Fourier coefficients related to theta functions which encode the number of such representations, we verify that Sun's conjecture is true for sufficiently large positive integers. Since there are only finitely many choices of m appearing in Sun's conjecture, this reduces Sun's conjecture to a verification of finitely many cases. Moreover, the bound beyond which we prove that Sun's conjecture holds is explicit.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信