Skip navigation
Skip navigation

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

Greenhill, Catherine; McKay, Brendan; Wang, Xiaoji


Let s = (s1,..., sm) and t = (t1,..., tn) be vectors of non-negative integer-valued functions with equal sum S = ∑i=1m si = ∑j=1n tj. Let N(s, t) be the number of m × n matrices with entries from {0, 1} such that the ith row has row sum si and the jt

CollectionsANU Research Publications
Date published: 2006
Type: Journal article
Source: Journal of Combinatorial Theory Series A
DOI: 10.1016/j.jcta.2005.03.005


File Description SizeFormat Image
01_Greenhill_Asymptotic_enumeration_of_2006.pdf1.05 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator