Factorization theorems for relatively prime divisor sums, GCD sums and generalized Ramanujan sums (Q829691)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Factorization theorems for relatively prime divisor sums, GCD sums and generalized Ramanujan sums
scientific article

    Statements

    Factorization theorems for relatively prime divisor sums, GCD sums and generalized Ramanujan sums (English)
    0 references
    0 references
    0 references
    6 May 2021
    0 references
    The authors give new factorization theorems for Lambert series which allow them to express formal generating functions for special sums as invertible matrix transformations involving partition functions. There are many formulas in the paper which look complicated to the reviewer but the authors of the article believe that the formulas will be useful in the future. Note also that there are two typographical errors on the second page of the paper. First, the last term in equation (1) should be \[ \sum_{\substack{1<d\leq x \\ 1<(d,x)<d}}f(d). \] Secondly, the term \(f(15)\) should be added to the right-hand side of the equation for \(\tilde{S_f}(24)\). There might be more errors on the other pages of the paper.
    0 references
    divisor sum
    0 references
    totient function
    0 references
    matrix factorization
    0 references
    Möbius inversion
    0 references
    partition function
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references