An asymptotic formula involving the triple divisor function

IF 0.6 3区 数学 Q3 MATHEMATICS
Guangwei Hu , Chenran Xu
{"title":"An asymptotic formula involving the triple divisor function","authors":"Guangwei Hu ,&nbsp;Chenran Xu","doi":"10.1016/j.jnt.2025.01.011","DOIUrl":null,"url":null,"abstract":"<div><div>Suppose <span><math><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo></math></span> denotes the classical triple divisor function. Let <span><math><mi>Q</mi><mo>(</mo><mrow><mi>x</mi><mo>)</mo></mrow></math></span> be a positive definite integral quadratic form, and <span><math><mi>r</mi><mo>(</mo><mi>n</mi><mo>,</mo><mi>Q</mi><mo>)</mo></math></span> denote the number of representations of <em>n</em> by the quadratic form <em>Q</em>. In this paper, we will establish an asymptotic formula of the summation<span><span><span><math><munder><mo>∑</mo><mrow><mi>n</mi><mo>≤</mo><mi>X</mi></mrow></munder><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>(</mo><mi>n</mi><mo>+</mo><mi>h</mi><mo>)</mo><mi>r</mi><mo>(</mo><mi>n</mi><mo>,</mo><mi>Q</mi><mo>)</mo><mo>,</mo></math></span></span></span> where <em>h</em> is a positive integer satisfying <span><math><mi>h</mi><mo>≤</mo><mi>H</mi><mo>≪</mo><msup><mrow><mi>X</mi></mrow><mrow><mn>1</mn><mo>−</mo><mi>ε</mi></mrow></msup></math></span>. Our result breaks through the trivial bound of the above summation and obtains the power saving in <em>O</em>-term.</div></div>","PeriodicalId":50110,"journal":{"name":"Journal of Number Theory","volume":"271 ","pages":"Pages 328-347"},"PeriodicalIF":0.6000,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Number Theory","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022314X25000307","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Suppose d3(n) denotes the classical triple divisor function. Let Q(x) be a positive definite integral quadratic form, and r(n,Q) denote the number of representations of n by the quadratic form Q. In this paper, we will establish an asymptotic formula of the summationnXd3(n+h)r(n,Q), where h is a positive integer satisfying hHX1ε. Our result breaks through the trivial bound of the above summation and obtains the power saving in O-term.
一个包含三重因子函数的渐近公式
假设d3(n)是经典的三重因子函数。设Q(x)为正积分的二次型,r(n,Q)表示n以二次型Q表示的个数。本文建立求和∑n≤Xd3(n+h)r(n,Q)的渐近公式,其中h为满足h≤h≪X1−ε的正整数。我们的结果突破了上述求和的平凡界,得到了o项的省电性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Number Theory
Journal of Number Theory 数学-数学
CiteScore
1.30
自引率
14.30%
发文量
122
审稿时长
16 weeks
期刊介绍: The Journal of Number Theory (JNT) features selected research articles that represent the broad spectrum of interest in contemporary number theory and allied areas. A valuable resource for mathematicians, the journal provides an international forum for the publication of original research in this field. The Journal of Number Theory is encouraging submissions of quality, long articles where most or all of the technical details are included. The journal now considers and welcomes also papers in Computational Number Theory. Starting in May 2019, JNT will have a new format with 3 sections: JNT Prime targets (possibly very long with complete proofs) high impact papers. Articles published in this section will be granted 1 year promotional open access. JNT General Section is for shorter papers. We particularly encourage submission from junior researchers. Every attempt will be made to expedite the review process for such submissions. Computational JNT . This section aims to provide a forum to disseminate contributions which make significant use of computer calculations to derive novel number theoretic results. There will be an online repository where supplementary codes and data can be stored.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信