Asymptotic enumeration of 0 - 1 matrices with equal row sums and equal column sums

McKay, Brendan; Wang, Xiaoji

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Asymptotic enumeration of 0 - 1 matrices with equal row sums and equal column sums

Date

2003

Authors

McKay, Brendan

Wang, Xiaoji

Publisher

Elsevier

Abstract

Let s, t, m, n be positive integers such that sm=tn. Define N(s,t;m,n) to be the number of m×n matrices with entries from {0,1}, such that each row sum is s and each column sum is t. Equivalently, N(s,t;m,n) is the number of labelled semiregular bipartit