English

Evaluation of Convolution Sums entailing mixed Divisor Functions for a Class of Levels

Number Theory 2019-05-15 v2

Abstract

Let 0<n,α,βN0< n,\alpha,\beta\in\mathbb{N} be such that gcd(α,β)=1\gcd{(\alpha,\beta)}=1. We carry out the evaluation of the convolution sums (k,l)N2αk+βl=nσ(k)σ3(l)\underset{\substack{ {(k,l)\in\mathbb{N}^{2}} \\ {\alpha\,k+\beta\,l=n} } }{\sum}\sigma(k)\sigma_{3}(l) and (k,l)N2αk+βl=nσ3(k)σ(l)\underset{\substack{ {(k,l)\in\mathbb{N}^{2}} \\ {\alpha\,k+\beta\,l=n} } }{\sum}\sigma_{3}(k)\sigma(l) for all levels αβN\alpha\beta\in\mathbb{N}, by using in particular modular forms. We next apply convolution sums belonging to this class of levels to determine formulae for the number of representations of a positive integer nn by the quadratic forms in twelve variables 12i=1xi2\underset{i=1}{\overset{12}{\sum}}x_{i}^{2} when the level αβ0(mod4)\alpha\beta\equiv 0\pmod{4}, and 6i=1(x2i12+x2i1x2i+x2i2)\underset{i=1}{\overset{6}{\sum}}\,(\,x_{2i-1}^{2}+ x_{2i-1}x_{2i} + x_{2i}^{2}\,) when the level αβ0(mod3)\alpha\beta\equiv 0\pmod{3}. Our approach is then illustrated by explicitly evaluating the convolution sum for αβ=3\alpha\beta=3, 44, 66, 77, 88, 99, 1212, 1414, 1515, 1616, 1818, 2020, 2121, 2727, 3232. These convolution sums are then applied to determine explicit formulae for the number of representations of a positive integer nn by quadratic forms in twelve variables.

Keywords

Cite

@article{arxiv.1903.06019,
  title  = {Evaluation of Convolution Sums entailing mixed Divisor Functions for a Class of Levels},
  author = {Ebénézer Ntienjem},
  journal= {arXiv preprint arXiv:1903.06019},
  year   = {2019}
}

Comments

51 pages, 9 tables. arXiv admin note: text overlap with arXiv:1609.01343, arXiv:1607.01082