Factorization Theorems for Relatively Prime Divisor Sums, GCD Sums and Generalized Ramanujan Sums
Hamed Mousavi, Maxie D. Schmidt

TL;DR
This paper develops new matrix-based factorization theorems for Lambert series and related sums, providing novel identities and formulas for various arithmetic functions including Euler's totient, Ramanujan sums, and the Mertens function.
Contribution
It introduces generalized factorization theorems for divisor sums and GCD sums, extending previous results with matrix methods and Fourier analysis, applicable to a wide range of arithmetic functions.
Findings
Derived new identities for Euler's totient function
Established formulas for Ramanujan sums and divisor functions
Connected partition functions to arithmetic sums via matrix factorizations
Abstract
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients for some arithmetic function . Our new factorization theorems provide analogs to these established expansions generating sums of the form (type I) and the Anderson-Apostol sums (type II) for any arithmetic functions and . Our treatment of the type II sums includes a matrix-based factorization method relating the partition function to arbitrary arithmetic functions . We also conclude the last section of the article by directly expanding new formulas for an arithmetic function by the type II sums using discrete Fourier transforms for functions over inputs of greatest common divisors and by suitably defined orthogonal polynomial sequences whose weight function we can define…
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.
