Elementary Evaluation of Convolution Sums involving primitive Dirichlet Characters for a Class of positive Integers
Eb\'en\'ezer Ntienjem

TL;DR
This paper extends the evaluation of convolution sums involving primitive Dirichlet characters for all positive integers, using modular forms, and applies these results to count representations of integers by specific octonary quadratic forms.
Contribution
It generalizes previous results to all positive integers and introduces new methods for evaluating convolution sums using modular forms and Dirichlet characters.
Findings
Evaluated convolution sums for new classes of integers.
Derived formulas for representations by specific octonary quadratic forms.
Provided explicit examples illustrating the method.
Abstract
We extend the results obtained by E. Ntienjem to all positive integers. Let be the subset of consisting of , where is in and is a squarefree finite product of distinct odd primes. We discuss the evaluation of the convolution sum, , when is in . 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 , , , , . If , we determine natural numbers and use the evaluated convolution sums together with other known convolution sums to carry out the number of representations of …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Algebraic Geometry and Number Theory
