Poly-Bernoulli number

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, poly-Bernoulli numbers, denoted as Bn(k), were defined by M. Kaneko as

Lik(1ex)1ex=n=0Bn(k)xnn!

where Li is the polylogarithm. The Bn(1) are the usual Bernoulli numbers.

Moreover, the Generalization of Poly-Bernoulli numbers with a,b,c parameters defined as follows

Lik(1(ab)x)bxaxcxt=n=0Bn(k)(t;a,b,c)xnn!

where Li is the polylogarithm.

Kaneko also gave two combinatorial formulas:

Bn(k)=m=0n(1)m+nm!S(n,m)(m+1)k,
Bn(k)=j=0min(n,k)(j!)2S(n+1,j+1)S(k+1,j+1),

where S(n,k) is the number of ways to partition a size n set into k non-empty subsets (the Stirling number of the second kind).

A combinatorial interpretation is that the poly-Bernoulli numbers of negative index enumerate the set of n by k (0,1)-matrices uniquely reconstructible from their row and column sums. Also it is the number of open tours by a biased rook on a board 11n00k (see A329718 for definition).

The Poly-Bernoulli number Bk(k) satisfies the following asymptotic:[1]

Bk(k)(k!)21kπ(1log2)(1log2)2k+1,as k.

For a positive integer n and a prime number p, the poly-Bernoulli numbers satisfy

Bn(p)2n(modp),

which can be seen as an analog of Fermat's little theorem. Further, the equation

Bx(n)+By(n)=Bz(n)

has no solution for integers x, y, z, n > 2; an analog of Fermat's Last Theorem. Moreover, there is an analogue of Poly-Bernoulli numbers (like Bernoulli numbers and Euler numbers) which is known as Poly-Euler numbers.

See also

References

Template:Reflist