Evaluation of the convolution sums $W_{1,42}(n),$ $W_{2,21}(n),$ $W_{3,14}(n)$ and $W_{6,7}(n)$
B\"ulent K\"okl\"uce

TL;DR
This paper evaluates specific convolution sums using modular forms and applies these results to determine the number of representations of integers by a particular quadratic form.
Contribution
It introduces a modular form approach to explicitly evaluate convolution sums and uses these to analyze representations by a complex quadratic form.
Findings
Explicit formulas for convolution sums involving divisor functions.
Determination of representation counts for a specific quadratic form.
Application of modular forms to quadratic form analysis.
Abstract
In this paper, we use a modular form approach to evaluate the convolution sums , and for all positive integers and then use their evaluations to determine the number of representation of a positive integer by the quadratic form .
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
TopicsCoding theory and cryptography · Cryptography and Residue Arithmetic · Analytic Number Theory Research
