Asymptotic enumeration of lonesum matrices

@article{Khera2021AsymptoticEO,
  title={Asymptotic enumeration of lonesum matrices},
  author={Jessica Khera and E. Lundberg and Stephen Melczer},
  journal={Adv. Appl. Math.},
  year={2021},
  volume={123},
  pages={102118}
}
We provide asymptotics for the poly-Bernoulli numbers, a combinatorial array that enumerates lonesum matrices. We obtain these (bivariate) asymptotics as an application of ACSV (Analytic Combinatorics in Several Variables). For the diagonal asymptotic (i.e., for the special case of square lonesum matrices) we present an alternative proof based on Parseval's identity. We also strengthen an existing result on asymptotic enumeration of permutations having a specified excedance set. 
2 Citations

Figures from this paper

References

SHOWING 1-10 OF 24 REFERENCES
Analytic Combinatorics in Several Variables
  • 102
  • PDF
Combinatorial Properties of Poly-Bernoulli Relatives
  • 19
  • Highly Influential
  • PDF
Asymptotics of the extremal excedance set statistic
  • 7
  • PDF
Enumerative combinatorics
  • 3,451
On Poly-Bernoulli numbers
  • 189
  • PDF
Combinatorics of poly-Bernoulli numbers
  • 23
  • PDF
Noncommutative Biology: Sequential Regulation of Complex Networks
  • 11
  • PDF
...
1
2
3
...