Asymptotic enumeration of incidence matrices
Combinatorics
2009-11-11 v1
Abstract
We discuss the problem of counting {\em incidence matrices}, i.e. zero-one matrices with no zero rows or columns. Using different approaches we give three different proofs for the leading asymptotics for the number of matrices with ones as . We also give refined results for the asymptotic number of incidence matrices with ones.
Keywords
Cite
@article{arxiv.math/0511008,
title = {Asymptotic enumeration of incidence matrices},
author = {Peter Cameron and Thomas Prellberg and Dudley Stark},
journal= {arXiv preprint arXiv:math/0511008},
year = {2009}
}
Comments
jpconf style files. Presented at the conference "Counting Complexity: An international workshop on statistical mechanics and combinatorics." In celebration of Prof. Tony Guttmann's 60th birthday