A reduced formula for the precise number of (0, 1)-matrices in A(R, S)
From MaRDI portal
Publication:1849941
Recommendations
Cited in
(10)- On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
- Improved decoding and error floor analysis of staircase codes
- On the largest size of an antichain in the Bruhat order for A (2k,k)
- Counting formulas for restricted matrix of set
- Exact sampling and counting for fixed-margin matrices
- Chains and antichains in the Bruhat order for classes of (0,1)-matrices
- Majorization and the number of bipartite graphs for given vertex degrees
- Enumeration of \((0,1)\)-matrices with constant row and column sums
- Antichains in the Bruhat order for the classes \(\mathcal{A}(n,k)\)
- MCMC conditional maximum likelihood for the two-way fixed-effects logit
This page was built for publication: A reduced formula for the precise number of (0, 1)-matrices in \({\mathcal A}\)(R, S)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849941)