Elementary Evaluation of Convolution Sums involving primitive Dirichlet Characters for a Class of positive Integers

preprint2016arXivOpen access

Abstract

We extend the results obtained by E. Ntienjem to all positive integers. Let $\EuFrak{N}$ be the subset of N\mathbb{N} consisting of  2ν℧\,2^ν\mho, where νν is in {0,1,2,3}\{0,1,2,3\} and ℧\mho 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)\underset{\substack{ {(l,m)\in\mathbb{N}^{2}} {α\,l+β\,m=n} } }{\sum}σ(l)σ(m), when αβαβ is in $\mathbb{N}\setminus\EuFrak{N}$. 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αβ=9, 1616, 1818, 2525, 3636. If αβ≡0(mod4)αβ\equiv 0 \pmod{4}, we determine natural numbers a,ba,b and use the evaluated convolution sums together with other known convolution sums to carry out the number of representations of nn by the octonary quadratic forms a (x12+x22+x32+x42)+b (x52+x62+x72+x82)a\,(x_{1}^{2} + x_{2}^{2} + x_{3}^{2} + x_{4}^{2})+ b\,(x_{5}^{2} + x_{6}^{2} + x_{7}^{2} + x_{8}^{2}). Similarly, if αβ≡0(mod3)αβ\equiv 0 \pmod{3}, we compute natural numbers c,dc,d and make use of the evaluated convolution sums together with other known convolution sums to determine the number of representations of nn by the octonary quadratic forms c ( x12+x1x2+x22+x32+x3x4+x42 )+d ( x52+x5x6+x62+x72+x7x8+x82 )c\,(\,x_{1}^{2} + x_{1}x_{2} + x_{2}^{2} + x_{3}^{2} + x_{3}x_{4} + x_{4}^{2}\,) + d\,(\,x_{5}^{2} + x_{5}x_{6} + x_{6}^{2} + x_{7}^{2} + x_{7}x_{8} + x_{8}^{2}\,). We illustrate our method with the explicit examples αβ=32⋅5αβ= 3^{2}\cdot 5, αβ=24⋅3αβ= 2^{4}\cdot 3, αβ=2⋅52αβ= 2\cdot 5^{2} and αβ=26αβ= 2^{6}, .

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.