An identity involving counts of binary matrices
Combinatorics
2025-11-27 v2 Probability
Abstract
In the context of generating uniform random contingency tables with pre-specified marginals, the number of (binary) matrices with given row- and column-sums is a well-studied object in the literature. We will denote this number by , where and are the vectors of row- and column-sums. The existing literature is mainly focused on computing or approximating . In this paper, we present two identities for polynomials whose coefficients depend on the and explore some consequences.
Cite
@article{arxiv.2511.02883,
title = {An identity involving counts of binary matrices},
author = {Hannes Leeb},
journal= {arXiv preprint arXiv:2511.02883},
year = {2025}
}