A reduced formula for the precise number of (0, 1)-matrices in \({\mathcal A}\)(R, S)

DOI10.1016/S0012-365X(01)00472-1zbMath1007.05032OpenAlexW2024491274MaRDI QIDQ1849941

Blanca Rosa Pérez-Salvador, Adolfo Torres-Cházaro, Miguel Ángel Gutiérrez-Andrade, Sergio Gerardo de-los-Cobos-Silva

Publication date: 2 December 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00472-1

zbMATH Keywords

enumeration of matrices

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrices of integers (15B36)

Related Items (6)

Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices ⋮ Exact sampling and counting for fixed-margin matrices ⋮ Enumeration of \((0,1)\)-matrices with constant row and column sums ⋮ On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\) ⋮ Improved decoding and error floor analysis of staircase codes ⋮ Majorization and the number of bipartite graphs for given vertex degrees

This page was built for publication: A reduced formula for the precise number of (0, 1)-matrices in \({\mathcal A}\)(R, S)