Combinatorics of poly-Bernoulli numbers

DOI10.1556/012.2015.52.4.1325MaRDI QIDQ2973120zbMATH OpenOpenAlexFDO

Authors Beáta Bényi, Péter Hajnal

Publication date 31 March 2017

Published in Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.05765

zbMATH Keywords

bijective proofscombinatorial methodsenumerationexcluded submatricespoly-Bernoulli numbers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Bernoulli and Euler numbers and polynomials (11B68)

Abstract: The ${mathbbB}_n^{(k)}$ poly-Bernoulli numbers --- a natural generalization of classical Bernoulli numbers ($B_n={mathbbB}_n^{(1)}$) --- were introduced by Kaneko in 1997. When the parameter $k$ is negative then ${mathbbB}_n^{(k)}$ is a nonnegative number. Brewbaker was the first to give combinatorial interpretation of these numbers. He proved that ${mathbbB}_n^{(-k)}$ counts the so called lonesum $0ext-1$ matrices of size $nimesk$. 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

Recommendations

• Poly-Bernoulli numbers
• scientific article; zbMATH DE number 1845554
• Combinatorial properties of poly-Bernoulli relatives
• On \(q\)-poly-Bernoulli numbers arising from combinatorial interpretations
• A Note on a Closed Formula for Poly-Bernoulli Numbers
• Recursion formulas for poly-Bernoulli numbers and their applications
• A formula for multi-poly-Bernoulli numbers of negative index
• scientific article; zbMATH DE number 6533833
• Bijective enumerations of \(\Gamma\)-free \(0\)-\(1\) matrices
• Explicit formulas for the Bernoulli and Euler polynomials and numbers

Cited in

(23)

• Restricted \(r\)-Stirling numbers and their combinatorial applications
• Degenerate poly-Bernoulli polynomials arising from degenerate polylogarithm
• On \(q\)-poly-Bernoulli numbers arising from combinatorial interpretations
• Bijective enumerations for symmetrized poly-Bernoulli polynomials
• Lonesum and \(\Gamma\)-free \(0-1\) fillings of Ferrers shapes
• Asymptotic enumeration of lonesum matrices
• On the combinatorics of the Boros-Moll polynomials
• Bijective enumerations of \(\Gamma\)-free \(0\)-\(1\) matrices
• On the combinatorics of symmetrized poly-Bernoulli numbers
• Toppling on permutations with an extra chip
• scientific article; zbMATH DE number 52043 (Why is no real title available?)
• Poly-Bernoulli Numbers and Eulerian Numbers
• On a duality formula for certain sums of values of poly-Bernoulli polynomials and its application
• scientific article; zbMATH DE number 1441933 (Why is no real title available?)
• Combinatorial proof of an identity on Genocchi numbers
• Combinatorial properties of poly-Bernoulli relatives
• A combinatorial interpretation of the poly-Bernoulli numbers and two Fermat analogues
• Recursion formulas for poly-Bernoulli numbers and their applications
• REMARKABLE RELATIONS BETWEEN THE CENTRAL BINOMIAL SERIES, EULERIAN POLYNOMIALS, AND POLY-BERNOULLI NUMBERS, LEADING TO STEPHAN'S OBSERVATION
• Poly-Cauchy numbers of the second kind - the combinatorics behind
• Encoding and enumerating acyclic orientations of graphs
• The distribution of the length of the longest path in random acyclic orientations of a complete bipartite graph
• Shuffles of deformed permutahedra, multiplihedra, constrainahedra, and biassociahedra

This page was built for publication: Combinatorics of poly-Bernoulli numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2973120)