Conical pendulum

From formulasearchengine
Revision as of 13:56, 12 December 2013 by en>Manoguru
Jump to navigation Jump to search

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 by H. Jolany 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.

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.

References

  • Hassan Jolany, Explicit formula for generalization of Poly-Bernoulli numbers and polynomials with a,b,c parameters, [1],2012
  • M. Kaneko, Poly-Bernoulli numbers, Journal de Theorie des Nombres de Bordeaux, 9:221-228, 1997
  • Chad Brewbaker, Lonesum (0,1)-matrices and poly-Bernoulli numbers of negative index, Master's thesis, Iowa State University, 2005
  • Chad Brewbaker, A Combinatorial Interpretation of the Poly-Bernoulli Numbers and Two Fermat Analogues, INTEGERS, VOL 8, A3, 2008