Asymptotic enumeration of lonesum matrices

DOI10.1016/j.aam.2020.102118zbMath1457.05010arXiv1912.08850OpenAlexW3095361659MaRDI QIDQ2221782

Stephen Melczer, Erik Lundberg, Jessica Khera

Publication date: 2 February 2021

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

asymptoticsgenerating functionpoly-Bernoulli numbersanalytic combinatoricslonesum matrices

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16) Algebraic statistics (62R01)

Related Items (1)

Toppling on permutations with an extra chip

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic lattice path enumeration using diagonals
• Asymptotics of multivariate sequences. III: Quadratic points
• Poly-Bernoulli numbers
• The excedance set of a permutation
• Asymptotics of the extremal excedance set statistic
• Matrix Schubert varieties and Gaussian conditional independence models
• Analytic Combinatorics in Several Variables
• Combinatorics of poly-Bernoulli numbers
• Combinatorial Properties of Matrices of Zeros and Ones
• Twenty Combinatorial Examples of Asymptotics Derived from Multivariate Generating Functions
• Multiple zeta values, poly-Bernoulli numbers, and related zeta functions
• Higher Dimensional Lattice Walks: Connecting Combinatorial and Analytic Behavior
• Combinatorial properties of poly-Bernoulli relatives

This page was built for publication: Asymptotic enumeration of lonesum matrices