Papers
Topics
Authors
Recent
Search
2000 character limit reached

Combinatorics of poly-Bernoulli numbers

Published 20 Oct 2015 in math.CO | (1510.05765v1)

Abstract: The ${\mathbb B}_n{(k)}$ poly-Bernoulli numbers --- a natural generalization of classical Bernoulli numbers ($B_n={\mathbb B}_n{(1)}$) --- were introduced by Kaneko in 1997. When the parameter $k$ is negative then ${\mathbb B}_n{(k)}$ is a nonnegative number. Brewbaker was the first to give combinatorial interpretation of these numbers. He proved that ${\mathbb B}_n{(-k)}$ counts the so called lonesum $0\text{-}1$ matrices of size $n\times k$. Several other interpretations were pointed out. We survey these and give new ones. Our new interpretation, for example, gives a transparent, combinatorial explanation of Kaneko's recursive formula for poly-Bernoulli numbers

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.