English

Poly-Bernoulli numbers and lonesum matrices

Combinatorics 2017-01-20 v1

Abstract

A lonesum matrix is a matrix that can be uniquely reconstructed from its row and column sums. Kaneko defined the poly-Bernoulli numbers Bm(n)B_m^{(n)} by a generating function, and Brewbaker computed the number of binary lonesum m×nm\times n-matrices and showed that this number coincides with the poly-Bernoulli number Bm(n)B_m^{(-n)}. We compute the number of qq-ary lonesum m×nm\times n-matrices, and then provide generalized Kaneko's formulas by using the generating function for the number of qq-ary lonesum m×nm\times n-matrices. In addition, we define two types of qq-ary lonesum matrices that are composed of strong and weak lonesum matrices, and suggest further researches on lonesum matrices. \

Cite

@article{arxiv.1103.4884,
  title  = {Poly-Bernoulli numbers and lonesum matrices},
  author = {Hyun Kwang Kim and Denis S. Krotov and Joon Yop Lee},
  journal= {arXiv preprint arXiv:1103.4884},
  year   = {2017}
}

Comments

27 pages

R2 v1 2026-06-21T17:44:19.077Z