除数函数三重卷积和的显式计算

IF 0.5 3区 数学 Q3 MATHEMATICS International Journal of Number Theory Pub Date : 2024-04-27 DOI:10.1142/s1793042124500544
B. Ramakrishnan, Brundaban Sahu, Anup Kumar Singh
{"title":"除数函数三重卷积和的显式计算","authors":"B. Ramakrishnan, Brundaban Sahu, Anup Kumar Singh","doi":"10.1142/s1793042124500544","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we use the theory of modular forms and give a general method to obtain the convolution sums <disp-formula-group><span><math altimg=\"eq-00001.gif\" display=\"block\" overflow=\"scroll\"><mrow><msubsup><mrow><mi>W</mi></mrow><mrow><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow><mrow><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow></msubsup><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo><mo>=</mo><munder><mrow><mo>∑</mo></mrow><mrow><mfrac linethickness=\"0\"><mrow><msub><mrow><mi>l</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>l</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>l</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>∈</mo><mi>ℕ</mi></mrow><mrow><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>l</mi></mrow><mrow><mn>1</mn></mrow></msub><mo stretchy=\"false\">+</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>2</mn></mrow></msub><msub><mrow><mi>l</mi></mrow><mrow><mn>2</mn></mrow></msub><mo stretchy=\"false\">+</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub><msub><mrow><mi>l</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>=</mo><mi>n</mi></mrow></mfrac></mrow></munder><msub><mrow><mi>σ</mi></mrow><mrow><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></msub><mo stretchy=\"false\">(</mo><msub><mrow><mi>l</mi></mrow><mrow><mn>1</mn></mrow></msub><mo stretchy=\"false\">)</mo><msub><mrow><mi>σ</mi></mrow><mrow><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></msub><mo stretchy=\"false\">(</mo><msub><mrow><mi>l</mi></mrow><mrow><mn>2</mn></mrow></msub><mo stretchy=\"false\">)</mo><msub><mrow><mi>σ</mi></mrow><mrow><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow></msub><mo stretchy=\"false\">(</mo><msub><mrow><mi>l</mi></mrow><mrow><mn>3</mn></mrow></msub><mo stretchy=\"false\">)</mo><mo>,</mo></mrow></math></span><span></span></disp-formula-group> for odd integers <span><math altimg=\"eq-00002.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>≥</mo><mn>1</mn><mo>,</mo><mspace width=\"0.25em\"></mspace></math></span><span></span> and <span><math altimg=\"eq-00003.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>,</mo><mi>n</mi><mo>∈</mo><mi>ℕ</mi></math></span><span></span>, where <span><math altimg=\"eq-00004.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>σ</mi></mrow><mrow><mi>r</mi></mrow></msub><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo></math></span><span></span> is the sum of the <span><math altimg=\"eq-00005.gif\" display=\"inline\" overflow=\"scroll\"><mi>r</mi></math></span><span></span>th powers of the positive divisors of <span><math altimg=\"eq-00006.gif\" display=\"inline\" overflow=\"scroll\"><mi>n</mi></math></span><span></span>. We consider four cases, namely (i) <span><math altimg=\"eq-00007.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>=</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>=</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>=</mo><mn>1</mn></math></span><span></span>, (ii) <span><math altimg=\"eq-00008.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>=</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>=</mo><mn>1</mn></math></span><span></span>; <span><math altimg=\"eq-00009.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>≥</mo><mn>3</mn></math></span><span></span> (iii) <span><math altimg=\"eq-00010.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>=</mo><mn>1</mn></math></span><span></span>; <span><math altimg=\"eq-00011.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>≥</mo><mn>3</mn></math></span><span></span> and (iv) <span><math altimg=\"eq-00012.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>≥</mo><mn>3</mn></math></span><span></span>, and give explicit expressions for the respective convolution sums. We provide several examples of these convolution sums in each case and further use these formulas to obtain explicit formulas for the number of representations of a positive integer <span><math altimg=\"eq-00013.gif\" display=\"inline\" overflow=\"scroll\"><mi>n</mi></math></span><span></span> by certain positive definite quadratic forms. The existing formulas for <span><math altimg=\"eq-00014.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>1</mn></mrow></msub><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo></math></span><span></span> (in [20]), <span><math altimg=\"eq-00015.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn></mrow></msub><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo><mo>,</mo><msub><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>2</mn></mrow></msub><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo><mo>,</mo><msub><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn></mrow></msub><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo></math></span><span></span> (in [7]), <span><math altimg=\"eq-00016.gif\" display=\"inline\" overflow=\"scroll\"><msubsup><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>1</mn></mrow><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn></mrow></msubsup><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo><mo>,</mo><msubsup><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>3</mn></mrow><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn></mrow></msubsup><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo><mo>,</mo><msubsup><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn></mrow><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn></mrow></msubsup><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo><mo>,</mo><msubsup><mrow><mi>W</mi></mrow><mrow><mn>3</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>1</mn></mrow><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn></mrow></msubsup><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo><mo>,</mo><msubsup><mrow><mi>W</mi></mrow><mrow><mn>3</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>1</mn></mrow><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn></mrow></msubsup><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo></math></span><span></span> (in [35]), <span><math altimg=\"eq-00017.gif\" display=\"inline\" overflow=\"scroll\"><msub><mrow><mi>W</mi></mrow><mrow><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow></msub><mo stretchy=\"false\">(</mo><mi>n</mi><mo stretchy=\"false\">)</mo></math></span><span></span>, <span><math altimg=\"eq-00018.gif\" display=\"inline\" overflow=\"scroll\"><mstyle><mtext mathvariant=\"normal\">lcm</mtext></mstyle><mo stretchy=\"false\">(</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub><mo stretchy=\"false\">)</mo><mo>≤</mo><mn>6</mn></math></span><span></span> (in [30]) and <span><math altimg=\"eq-00019.gif\" display=\"inline\" overflow=\"scroll\"><mstyle><mtext mathvariant=\"normal\">lcm</mtext></mstyle><mo stretchy=\"false\">(</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub><mo stretchy=\"false\">)</mo><mo>=</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>9</mn></math></span><span></span> (in [31]), which were all obtained by using the theory of quasimodular forms, follow from our method.</p>","PeriodicalId":14293,"journal":{"name":"International Journal of Number Theory","volume":"60 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2024-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Explicit evaluation of triple convolution sums of the divisor functions\",\"authors\":\"B. Ramakrishnan, Brundaban Sahu, Anup Kumar Singh\",\"doi\":\"10.1142/s1793042124500544\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we use the theory of modular forms and give a general method to obtain the convolution sums <disp-formula-group><span><math altimg=\\\"eq-00001.gif\\\" display=\\\"block\\\" overflow=\\\"scroll\\\"><mrow><msubsup><mrow><mi>W</mi></mrow><mrow><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow><mrow><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow></msubsup><mo stretchy=\\\"false\\\">(</mo><mi>n</mi><mo stretchy=\\\"false\\\">)</mo><mo>=</mo><munder><mrow><mo>∑</mo></mrow><mrow><mfrac linethickness=\\\"0\\\"><mrow><msub><mrow><mi>l</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>l</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>l</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>∈</mo><mi>ℕ</mi></mrow><mrow><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>l</mi></mrow><mrow><mn>1</mn></mrow></msub><mo stretchy=\\\"false\\\">+</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>2</mn></mrow></msub><msub><mrow><mi>l</mi></mrow><mrow><mn>2</mn></mrow></msub><mo stretchy=\\\"false\\\">+</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub><msub><mrow><mi>l</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>=</mo><mi>n</mi></mrow></mfrac></mrow></munder><msub><mrow><mi>σ</mi></mrow><mrow><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></msub><mo stretchy=\\\"false\\\">(</mo><msub><mrow><mi>l</mi></mrow><mrow><mn>1</mn></mrow></msub><mo stretchy=\\\"false\\\">)</mo><msub><mrow><mi>σ</mi></mrow><mrow><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></msub><mo stretchy=\\\"false\\\">(</mo><msub><mrow><mi>l</mi></mrow><mrow><mn>2</mn></mrow></msub><mo stretchy=\\\"false\\\">)</mo><msub><mrow><mi>σ</mi></mrow><mrow><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow></msub><mo stretchy=\\\"false\\\">(</mo><msub><mrow><mi>l</mi></mrow><mrow><mn>3</mn></mrow></msub><mo stretchy=\\\"false\\\">)</mo><mo>,</mo></mrow></math></span><span></span></disp-formula-group> for odd integers <span><math altimg=\\\"eq-00002.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>≥</mo><mn>1</mn><mo>,</mo><mspace width=\\\"0.25em\\\"></mspace></math></span><span></span> and <span><math altimg=\\\"eq-00003.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>,</mo><mi>n</mi><mo>∈</mo><mi>ℕ</mi></math></span><span></span>, where <span><math altimg=\\\"eq-00004.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mi>σ</mi></mrow><mrow><mi>r</mi></mrow></msub><mo stretchy=\\\"false\\\">(</mo><mi>n</mi><mo stretchy=\\\"false\\\">)</mo></math></span><span></span> is the sum of the <span><math altimg=\\\"eq-00005.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><mi>r</mi></math></span><span></span>th powers of the positive divisors of <span><math altimg=\\\"eq-00006.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><mi>n</mi></math></span><span></span>. We consider four cases, namely (i) <span><math altimg=\\\"eq-00007.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>=</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>=</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>=</mo><mn>1</mn></math></span><span></span>, (ii) <span><math altimg=\\\"eq-00008.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>=</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>=</mo><mn>1</mn></math></span><span></span>; <span><math altimg=\\\"eq-00009.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>≥</mo><mn>3</mn></math></span><span></span> (iii) <span><math altimg=\\\"eq-00010.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>=</mo><mn>1</mn></math></span><span></span>; <span><math altimg=\\\"eq-00011.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>≥</mo><mn>3</mn></math></span><span></span> and (iv) <span><math altimg=\\\"eq-00012.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mi>r</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>r</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>≥</mo><mn>3</mn></math></span><span></span>, and give explicit expressions for the respective convolution sums. We provide several examples of these convolution sums in each case and further use these formulas to obtain explicit formulas for the number of representations of a positive integer <span><math altimg=\\\"eq-00013.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><mi>n</mi></math></span><span></span> by certain positive definite quadratic forms. The existing formulas for <span><math altimg=\\\"eq-00014.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>1</mn></mrow></msub><mo stretchy=\\\"false\\\">(</mo><mi>n</mi><mo stretchy=\\\"false\\\">)</mo></math></span><span></span> (in [20]), <span><math altimg=\\\"eq-00015.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn></mrow></msub><mo stretchy=\\\"false\\\">(</mo><mi>n</mi><mo stretchy=\\\"false\\\">)</mo><mo>,</mo><msub><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>2</mn></mrow></msub><mo stretchy=\\\"false\\\">(</mo><mi>n</mi><mo stretchy=\\\"false\\\">)</mo><mo>,</mo><msub><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mn>4</mn></mrow></msub><mo stretchy=\\\"false\\\">(</mo><mi>n</mi><mo stretchy=\\\"false\\\">)</mo></math></span><span></span> (in [7]), <span><math altimg=\\\"eq-00016.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msubsup><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>1</mn></mrow><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn></mrow></msubsup><mo stretchy=\\\"false\\\">(</mo><mi>n</mi><mo stretchy=\\\"false\\\">)</mo><mo>,</mo><msubsup><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>3</mn></mrow><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn></mrow></msubsup><mo stretchy=\\\"false\\\">(</mo><mi>n</mi><mo stretchy=\\\"false\\\">)</mo><mo>,</mo><msubsup><mrow><mi>W</mi></mrow><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn></mrow><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn></mrow></msubsup><mo stretchy=\\\"false\\\">(</mo><mi>n</mi><mo stretchy=\\\"false\\\">)</mo><mo>,</mo><msubsup><mrow><mi>W</mi></mrow><mrow><mn>3</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>1</mn></mrow><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn></mrow></msubsup><mo stretchy=\\\"false\\\">(</mo><mi>n</mi><mo stretchy=\\\"false\\\">)</mo><mo>,</mo><msubsup><mrow><mi>W</mi></mrow><mrow><mn>3</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>1</mn></mrow><mrow><mn>1</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>3</mn></mrow></msubsup><mo stretchy=\\\"false\\\">(</mo><mi>n</mi><mo stretchy=\\\"false\\\">)</mo></math></span><span></span> (in [35]), <span><math altimg=\\\"eq-00017.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><msub><mrow><mi>W</mi></mrow><mrow><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub></mrow></msub><mo stretchy=\\\"false\\\">(</mo><mi>n</mi><mo stretchy=\\\"false\\\">)</mo></math></span><span></span>, <span><math altimg=\\\"eq-00018.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><mstyle><mtext mathvariant=\\\"normal\\\">lcm</mtext></mstyle><mo stretchy=\\\"false\\\">(</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub><mo stretchy=\\\"false\\\">)</mo><mo>≤</mo><mn>6</mn></math></span><span></span> (in [30]) and <span><math altimg=\\\"eq-00019.gif\\\" display=\\\"inline\\\" overflow=\\\"scroll\\\"><mstyle><mtext mathvariant=\\\"normal\\\">lcm</mtext></mstyle><mo stretchy=\\\"false\\\">(</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>3</mn></mrow></msub><mo stretchy=\\\"false\\\">)</mo><mo>=</mo><mn>7</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>9</mn></math></span><span></span> (in [31]), which were all obtained by using the theory of quasimodular forms, follow from our method.</p>\",\"PeriodicalId\":14293,\"journal\":{\"name\":\"International Journal of Number Theory\",\"volume\":\"60 1\",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-04-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Number Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1142/s1793042124500544\",\"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":"International Journal of Number Theory","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1142/s1793042124500544","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

本文利用模形式理论,给出了求卷积和 Wd1,d2,d3r1,r2,r3(n)=∑l1,l2 的一般方法、l3∈ℕd1l1+d2l2+d3l3=nσr1(l1)σr2(l2)σr3(l3),对于奇整数 r1,r2,r3≥1,以及 d1,d2,d3,n∈ℕ,其中 σr(n) 是 n 的正除数的 r 次幂和。我们考虑了四种情况,即 (i) r1=r2=r3=1,(ii) r1=r2=1; r3≥3 (iii) r1=1; r2,r3≥3 和 (iv) r1,r2,r3≥3,并给出了各自卷积和的明确表达式。我们举例说明了每种情况下的卷积和,并进一步利用这些公式得到了某些正定二次型对正整数 n 的表示数的明确公式。现有公式为 W1,1,1(n) (见 [20]), W1,1,2(n), W1,2,2(n), W1,2,4(n) (见 [7]), W1,1,11,3,3(n), W1,1,31,3,3(n), W1,3,31,3,3(n), W3,1,11,3,3(n), W3,3,11,3,3(n) (见 [35])、Wd1,d2,d3(n),lcm(d1,d2,d3)≤6(在 [30] 中)和 lcm(d1,d2,d3)=7,8,9 (在 [31] 中),都是利用准模态理论得到的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Explicit evaluation of triple convolution sums of the divisor functions

In this paper, we use the theory of modular forms and give a general method to obtain the convolution sums Wd1,d2,d3r1,r2,r3(n)=l1,l2,l3d1l1+d2l2+d3l3=nσr1(l1)σr2(l2)σr3(l3), for odd integers r1,r2,r31, and d1,d2,d3,n, where σr(n) is the sum of the rth powers of the positive divisors of n. We consider four cases, namely (i) r1=r2=r3=1, (ii) r1=r2=1; r33 (iii) r1=1; r2,r33 and (iv) r1,r2,r33, and give explicit expressions for the respective convolution sums. We provide several examples of these convolution sums in each case and further use these formulas to obtain explicit formulas for the number of representations of a positive integer n by certain positive definite quadratic forms. The existing formulas for W1,1,1(n) (in [20]), W1,1,2(n),W1,2,2(n),W1,2,4(n) (in [7]), W1,1,11,3,3(n),W1,1,31,3,3(n),W1,3,31,3,3(n),W3,1,11,3,3(n),W3,3,11,3,3(n) (in [35]), Wd1,d2,d3(n), lcm(d1,d2,d3)6 (in [30]) and lcm(d1,d2,d3)=7,8,9 (in [31]), which were all obtained by using the theory of quasimodular forms, follow from our method.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.10
自引率
14.30%
发文量
97
审稿时长
4-8 weeks
期刊介绍: This journal publishes original research papers and review articles on all areas of Number Theory, including elementary number theory, analytic number theory, algebraic number theory, arithmetic algebraic geometry, geometry of numbers, diophantine equations, diophantine approximation, transcendental number theory, probabilistic number theory, modular forms, multiplicative number theory, additive number theory, partitions, and computational number theory.
期刊最新文献
Riemann hypothesis for period polynomials for cusp forms on Γ0(N) Arithmetic progressions in polynomial orbits Lehmer-type bounds and counting rational points of bounded heights on Abelian varieties On mean values for the exponential sum of divisor functions Explicit evaluation of triple convolution sums of the divisor functions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1