Elementary Evaluation of Convolution Sums involving primitive Dirichlet Characters for a Class of positive Integers
Abstract
We extend the results obtained by E. Ntienjem to all positive integers. Let N be the subset of N consisting of \,2, where is in \0,1,2,3\ and is a squarefree finite product of distinct odd primes. We discuss the evaluation of the convolution sum, (l,m)∈N2 α\,l+β\,m=n Σσ(l)σ(m), when αβ is in NN. The evaluation of convolution sums belonging to this class is achieved by applying modular forms and primitive Dirichlet characters. In addition, we revisit the evaluation of the convolution sums for αβ=9, 16, 18, 25, 36. If αβ 0 4, we determine natural numbers a,b and use the evaluated convolution sums together with other known convolution sums to carry out the number of representations of n by the octonary quadratic forms a\,(x12 + x22 + x32 + x42)+ b\,(x52 + x62 + x72 + x82). Similarly, if αβ 0 3, we compute natural numbers c,d and make use of the evaluated convolution sums together with other known convolution sums to determine the number of representations of n by the octonary quadratic forms c\,(\,x12 + x1x2 + x22 + x32 + x3x4 + x42\,) + d\,(\,x52 + x5x6 + x62 + x72 + x7x8 + x82\,). We illustrate our method with the explicit examples αβ = 32· 5, αβ = 24· 3, αβ = 2· 52 and αβ = 26, .
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.