In mathematics, a Lambert series, named for Johann Heinrich Lambert, is a series taking the form
It can be resumed formally by expanding the denominator:
where the coefficients of the new series are given by the Dirichlet convolution of an with the constant function 1(n) = 1:
This series may be inverted by means of the Möbius inversion formula, and is an example of a Möbius transform.
Since this last sum is a typical number-theoretic sum, almost any natural multiplicative function will be exactly summable when used in a Lambert series. Thus, for example, one has
where is the number of positive divisors of the number n.
For the higher order sum-of-divisor functions, one has
where is any complex number and
is the divisor function. In particular, for , the Lambert series one gets is
which is (up to the factor of ) the logarithmic derivative of the usual generating function for partition numbers
Additional Lambert series related to the previous identity include those for the variants of the
Möbius function given below
Related Lambert series over the Moebius function include the following identities for any
prime :
The proof of the first identity above follows from a multi-section (or bisection) identity of these
Lambert series generating functions in the following form where we denote
to be the Lambert series generating function of the arithmetic function f:
The second identity in the previous equations follows from the fact that the coefficients of the left-hand-side sum are given by
where the function is the multiplicative identity with respect to the operation of Dirichlet convolution of arithmetic functions.
For Euler's totient function :
For Von Mangoldt function :
For Liouville's function :
with the sum on the right similar to the Ramanujan theta function, or Jacobi theta function . Note that Lambert series in which the an are trigonometric functions, for example, an = sin(2n x), can be evaluated by various combinations of the logarithmic derivatives of Jacobi theta functions.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Let be a positive integer. In number theory, the Jordan's totient function of a positive integer equals the number of -tuples of positive integers that are less than or equal to and that together with form a coprime set of integers. Jordan's totient function is a generalization of Euler's totient function, which is given by . The function is named after Camille Jordan. For each , Jordan's totient function is multiplicative and may be evaluated as where ranges through the prime divisors of .
In number theory, the prime omega functions and count the number of prime factors of a natural number Thereby (little omega) counts each distinct prime factor, whereas the related function (big omega) counts the total number of prime factors of honoring their multiplicity (see arithmetic function). That is, if we have a prime factorization of of the form for distinct primes (), then the respective prime omega functions are given by and . These prime factor counting functions have many important number theoretic relations.
In mathematics, the Dirichlet convolution is a binary operation defined for arithmetic functions; it is important in number theory. It was developed by Peter Gustav Lejeune Dirichlet. If are two arithmetic functions from the positive integers to the complex numbers, the Dirichlet convolution f ∗ g is a new arithmetic function defined by: where the sum extends over all positive divisors d of n, or equivalently over all distinct pairs (a, b) of positive integers whose product is n.
Let G be a connected reductive algebraic group over an algebraically closed field k,gamma is an element of g( k(( epsilon ))) a semisimple regular element, we introduce a fundamental domain F gamma for the affine Springer fibers X gamma. We show that the p ...
Springer Heidelberg2017
Let G be a finite subgroup of SU(4) such that its elements have age at most one. In the first part of this paper, we define K-theoretic stable pair invariants on a crepant resolution of the affine quotient C4/G, and conjecture a closed formula for their ge ...
We prove an asymptotic formula for the shifted convolution of the divisor functions d(k)(n) and d(n) with k >= 4, which is uniform in the shift parameter and which has a power saving error term, improving results obtained previously by Fouvry and Tenenbaum ...