How many matrices satisfy the following constraints?$n$ rows$n$ columnsCell values are either $0$ or $1$Sum of any row is at most $m$sum of any column is at most $m$Is there a formula or an efficient algorithm to solve this problem?
Number of $n \times n$ binary matrices whose rows and columns sum to at most $m$
algorithms;combinatorics;matrices