Combinatorics of poly-Bernoulli numbers

Abstract

The Bn(k) poly-Bernoulli numbers --- a natural generalization of classical Bernoulli numbers (Bn= Bn(1)) --- were introduced by Kaneko in 1997. When the parameter k is negative then Bn(k) is a nonnegative number. Brewbaker was the first to give combinatorial interpretation of these numbers. He proved that Bn(-k) counts the so called lonesum 0-1 matrices of size n× 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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…