Asymptotics for incidence matrix classes
The electronic journal of combinatorics, Tome 13 (2006)
We define incidence matrices to be zero-one matrices with no zero rows or columns. We are interested in counting incidence matrices with a given number of ones, irrespective of the number of rows or columns. A classification of incidence matrices is considered for which conditions of symmetry by transposition, having no repeated rows/columns, or identification by permutation of rows/columns are imposed. We find asymptotics and relationships for the number of matrices with $n$ ones in some of these classes as $n\to\infty$.
@article{10_37236_1111,
author = {Peter Cameron and Thomas Prellberg and Dudley Stark},
title = {Asymptotics for incidence matrix classes},
journal = {The electronic journal of combinatorics},
year = {2006},
volume = {13},
doi = {10.37236/1111},
zbl = {1114.05007},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1111/}
}
Peter Cameron; Thomas Prellberg; Dudley Stark. Asymptotics for incidence matrix classes. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1111
Cité par Sources :