/pdf/rigidly-foldable-quadrilateral-meshes-from-angle-arrays-38wd1znmjj.pdf

Rigidly Foldable Quadrilateral Meshes From Angle Arrays

In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show connections between the different areas where poly-Bernoulli numbers and their relatives appear and give examples how the combinatorial methods can be used for deriving formulas between integer arrays.

Combinatorial Properties of Poly-Bernoulli Relatives

of the Ph.D. Thesis Supervisor: Péter Hajnal Associate Professor Doctoral School of Mathematics and Computer Science University of Szeged Bolyai Institute

Advances in Bijective Combinatorics

Restricted $r$-Stirling Numbers and their Combinatorial Applications

In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of the main applications is in the study of lonesum matrices.

Some applications of S-restricted set partitions

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.

Combinatorics of poly-Bernoulli numbers

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

Beáta Bényi

Papers

Combinatorial Properties of Poly-Bernoulli Relatives

Combinatorics of poly-Bernoulli numbers

Combinatorics of poly-Bernoulli numbers

Restricted $r$-Stirling Numbers and their Combinatorial Applications

Some applications of S-restricted set partitions