Jump to content

Lambert series: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Maxieds (talk | contribs)
→‎Examples: Added a more complete list of standard examples of Lambert series.
Maxieds (talk | contribs)
Added new section on Lambert series factorization theorems
Line 79: Line 79:


which holds for all complex ''q'' not on the unit circle, would be considered a Lambert series identity. This identity follows in a straightforward fashion from some identities published by the Indian mathematician [[S. Ramanujan]]. A very thorough exploration of Ramanujan's works can be found in the works by [[Bruce Berndt]].
which holds for all complex ''q'' not on the unit circle, would be considered a Lambert series identity. This identity follows in a straightforward fashion from some identities published by the Indian mathematician [[S. Ramanujan]]. A very thorough exploration of Ramanujan's works can be found in the works by [[Bruce Berndt]].

==Factorization theorems==

A somewhat newer construction recently published over 2017--2018 relates to so-termed ''Lambert series factorization theorems'' of the form <ref>{{cite journal|last1=Merca|first1=Mircea|title=The Lambert series factorization theorem|journal=The Ramanujan Journal|date=13 January 2017|volume=44|issue=2|pages=417-435|url=https://link.springer.com/article/10.1007/s11139-016-9856-3}}</ref>

:<math>\sum_{n \geq 1} \frac{a_n q^n}{1\pm q^n} = \frac{1}{(\mp q; q)_{\infty}} \sum_{n \geq 1} \left((s_o(n, k) \pm s_e(n, k)) a_k\right) q^n, </math>

where <math>s_o(n, k) \pm s_e(n, k) = [q^n] (\mp q; q)_{\infty} \frac{q^k}{1 \pm q^k}</math> is the respective sum or difference of the
restricted partition functions <math>s_{e/o}(n, k)</math> which denote the number of <math>k</math>'s in all partitions of <math>n</math> into an ''even'' (respectively, ''odd'') number of distinct parts. Let <math>s_{n,k} := s_e(n, k) - s_o(n, k) = [q^n] (q; q)_{\infty} \frac{q^k}{1-q^k}</math> denote the invertible lower triangular sequence whose first few values are shown in the table below.

{| class="wikitable"
|-
! '''n \ k''' !! '''1''' !! '''2''' !! '''3''' !! '''4''' !! '''5''' !! '''6''' !! '''7''' !! '''8'''
|-
| '''1''' || 1 || 0 || 0 || 0 || 0 || 0 || 0 || 0
|-
| '''2''' || 0 || 1 || 0 || 0 || 0 || 0 || 0 || 0
|-
| '''3''' || -1 || -1 || 1 || 0 || 0 || 0 || 0 || 0
|-
| '''4''' || -1 || 0 || -1 || 1 || 0 || 0 || 0 || 0
|-
| '''5''' || -1 || -1 || -1 || -1 || 1 || 0 || 0 || 0
|-
| '''6''' || 0 || 0 || 1 || -1 || -1 || 1 || 0 || 0
|-
| '''7''' || 0 || 0 || -1 || 0 || -1 || -1 || 1 || 0
|-
| '''8''' || 1 || 0 || 0 || 1 || 0 || -1 || -1 || 1
|}

Another characteristic form of the Lambert series factorization theorem expansions is given by <ref>{{cite journal|last1=Merca, M. and Schmidt, M. D.|title=Generating Special Arithmetic Functions by Lambert Series Factorizations|journal=Contributions to Discrete Mathematics|date=2018|volume=to appear|url=https://arxiv.org/abs/1706.00393}}</ref>

:<math>L_f(q) := \sum_{n \geq 1} \frac{f(n) q^n}{1-q^n} = \frac{1}{(q; q)_{\infty}} \sum_{n \geq 1} \left(s_{n,k} f(k)\right) q^n, </math>

where <math>(q; q)_{\infty}</math> is the (infinite) [[q-Pochhammer symbol]]. The invertible matrix products on the right-hand-side of the previous equation correspond to inverse matrix products whose lower triangular entries are given in terms of the [[Partition_(number_theory)|partition function]] and the [[Möbius function]] by the [[divisor sums]]

:<math>s_{n,k}^{(-1)} = \sum_{d|n} p(d-k) \mu\left(\frac{n}{d}\right)</math>

The next table lists the first several rows of these corresponding inverse matrices <ref>{{cite web|title=A133732|url=https://oeis.org/A133732|website=Online Encylopedia of Integer Sequences|accessdate=22 April 2018}}</ref>.

{| class="wikitable"
|-
! '''n \ k''' !! '''1''' !! '''2''' !! '''3''' !! '''4''' !! '''5''' !! '''6''' !! '''7''' !! '''8'''
|-
| '''1''' || 1 || 0 || 0 || 0 || 0 || 0 || 0 || 0
|-
| '''2''' || 0 || 1 || 0 || 0 || 0 || 0 || 0 || 0
|-
| '''3''' || 1 || 1 || 1 || 0 || 0 || 0 || 0 || 0
|-
| '''4''' || 2 || 1 || 1 || 1 || 0 || 0 || 0 || 0
|-
| '''5''' || 4 || 3 || 2 || 1 || 1 || 0 || 0 || 0
|-
| '''6''' || 5 || 3 || 2 || 2 || 1 || 1 || 0 || 0
|-
| '''7''' || 10 || 7 || 5 || 3 || 2 || 1 || 1 || 0
|-
| '''8''' || 12 || 9 || 6 || 4 || 3 || 2 || 1 || 1
|}

We let <math>G_j := \frac{1}{2} \left\lceil \frac{j}{2} \right\rceil \left\lceil \frac{3j+1}{2} \right\rceil</math> denote the sequence of interleaved [[pentagonal numbers]], i.e., so that the [[pentagonal number theorem]] is expanded in the form of

:<math>(q; q)_{\infty} = \sum_{n \geq 0} (-1)^{\left\lceil \frac{n}{2} \right\rceil} q^{G_n}. </math>

Then for any Lambert series <math>L_f(q)</math> generating the sequence of <math>g(n) = (f \ast 1)(n)</math>, we have the corresponding inversion relation of the factorization theorem expanded above given by <ref>{{cite journal|last1=Schmidt|first1=Maxie D.|title=New Recurrence Relations and Matrix Equations for Arithmetic Functions Generated by Lambert Series|journal=Acta Arithmetica|date=8 December 2017|volume=181|pages=355-367|url=https://arxiv.org/abs/1701.06257}}</ref>

:<math>f(n) = \sum_{k=1}^n \sum_{d|n} p(d-k) \mu(n/d) \times \sum_{j: k-G_j > 0} (-1)^{\left\lceil \frac{j}{2} \right\rceil} b(k-G_j).</math>

This work on Lambert series factorization theorems is extended in <ref>{{cite journal|last1=M. Merca and Schmidt, M. D.|title=New Factor Pairs for Factorizations of Lambert Series Generating Functions|url=https://arxiv.org/abs/1706.02359}}</ref> to more general expansions of the form

:<math>\sum_{n \geq 1} \frac{a_n q^n}{1-q^n} = \frac{1}{C(q)} \sum_{n \geq 1} \left(\sum_{k=1}^n s_{n,k}(\gamma) \widetilde{a}_k(\gamma)\right) q^n, </math>

where <math>C(q)</math> is any (partition-related) reciprocal generating function, <math>\gamma(n)</math> is any [[arithmetic function]], and where the
modified coefficients are expanded by

:<math>\widetilde{a}_k(\gamma) = \sum_{d|k} \sum_{r| \frac{k}{d}} a_d \gamma(r). </math>

The corresponding inverse matrices in the above expansion satisfy

:<math>s_{n,k}^{(-1)}(\gamma) = \sum_{d|n} [q^{d-k}] \frac{1}{C(q)} \gamma\left(\frac{n}{d}\right), </math>

so that as in the first variant of the Lambert factorization theorem above we obtain an inversion relation for the right-hand-side coefficients of the form

:<math>\widetilde{a}_k(\gamma) = \sum_{k=1}^{n} s_{n,k}^{(-1)}(\gamma) \times [q^k]\left(\sum_{d=1}^k \frac{a_d q^q}{1-q^d} C(q)\right).</math>


==See also==
==See also==

Revision as of 04:47, 22 April 2018

Function , represented as a Matplotlib plot, using a version of the Domain coloring method[1]

In mathematics, a Lambert series, named for Johann Heinrich Lambert, is a series taking the form

It can be resummed 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.

Examples

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 sigma functions, one has

where is any complex number and

is the divisor function.

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.

Other Lambert series include those for the Möbius function :

For Euler's totient function :

For Liouville's function :

with the sum on the right similar to the Ramanujan theta function, or Jacobi theta function .

We also have a slightly more generalized Lambert series expansion generating the sum of squares function in the form of [2]

In general, if we write the Lambert series over which generates the arithmetic functions , the next pairs of functions correspond to other well-known convolutions expressed by their Lambert series generating functions in the forms of

where is the multiplicative identity for Dirichlet convolutions, is the identity function for powers, denotes the characteristic function for the squares, which counts the number of distinct prime factors of (see Omega function), is Jordan's totient function, and is the divisor function (see Dirichlet convolutions).

Alternate form

Substituting one obtains another common form for the series, as

where

as before. Examples of Lambert series in this form, with , occur in expressions for the Riemann zeta function for odd integer values; see Zeta constants for details.

Current usage

In the literature we find Lambert series applied to a wide variety of sums. For example, since is a polylogarithm function, we may refer to any sum of the form

as a Lambert series, assuming that the parameters are suitably restricted. Thus

which holds for all complex q not on the unit circle, would be considered a Lambert series identity. This identity follows in a straightforward fashion from some identities published by the Indian mathematician S. Ramanujan. A very thorough exploration of Ramanujan's works can be found in the works by Bruce Berndt.

Factorization theorems

A somewhat newer construction recently published over 2017--2018 relates to so-termed Lambert series factorization theorems of the form [3]

where is the respective sum or difference of the restricted partition functions which denote the number of 's in all partitions of into an even (respectively, odd) number of distinct parts. Let denote the invertible lower triangular sequence whose first few values are shown in the table below.

n \ k 1 2 3 4 5 6 7 8
1 1 0 0 0 0 0 0 0
2 0 1 0 0 0 0 0 0
3 -1 -1 1 0 0 0 0 0
4 -1 0 -1 1 0 0 0 0
5 -1 -1 -1 -1 1 0 0 0
6 0 0 1 -1 -1 1 0 0
7 0 0 -1 0 -1 -1 1 0
8 1 0 0 1 0 -1 -1 1

Another characteristic form of the Lambert series factorization theorem expansions is given by [4]

where is the (infinite) q-Pochhammer symbol. The invertible matrix products on the right-hand-side of the previous equation correspond to inverse matrix products whose lower triangular entries are given in terms of the partition function and the Möbius function by the divisor sums

The next table lists the first several rows of these corresponding inverse matrices [5].

n \ k 1 2 3 4 5 6 7 8
1 1 0 0 0 0 0 0 0
2 0 1 0 0 0 0 0 0
3 1 1 1 0 0 0 0 0
4 2 1 1 1 0 0 0 0
5 4 3 2 1 1 0 0 0
6 5 3 2 2 1 1 0 0
7 10 7 5 3 2 1 1 0
8 12 9 6 4 3 2 1 1

We let denote the sequence of interleaved pentagonal numbers, i.e., so that the pentagonal number theorem is expanded in the form of

Then for any Lambert series generating the sequence of , we have the corresponding inversion relation of the factorization theorem expanded above given by [6]

This work on Lambert series factorization theorems is extended in [7] to more general expansions of the form

where is any (partition-related) reciprocal generating function, is any arithmetic function, and where the modified coefficients are expanded by

The corresponding inverse matrices in the above expansion satisfy

so that as in the first variant of the Lambert factorization theorem above we obtain an inversion relation for the right-hand-side coefficients of the form

See also

References

  1. ^ http://nbviewer.ipython.org/github/empet/Math/blob/master/DomainColoring.ipynb
  2. ^ Weisstein, Eric W. "Lambert Series". MathWorld. Retrieved 22 April 2018.
  3. ^ Merca, Mircea (13 January 2017). "The Lambert series factorization theorem". The Ramanujan Journal. 44 (2): 417–435.
  4. ^ Merca, M. and Schmidt, M. D. (2018). "Generating Special Arithmetic Functions by Lambert Series Factorizations". Contributions to Discrete Mathematics. to appear.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  5. ^ "A133732". Online Encylopedia of Integer Sequences. Retrieved 22 April 2018.
  6. ^ Schmidt, Maxie D. (8 December 2017). "New Recurrence Relations and Matrix Equations for Arithmetic Functions Generated by Lambert Series". Acta Arithmetica. 181: 355–367.
  7. ^ M. Merca and Schmidt, M. D. "New Factor Pairs for Factorizations of Lambert Series Generating Functions". {{cite journal}}: Cite journal requires |journal= (help)