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 sparse nonnegative integer matrices with specified row and column sums

Date

Authors

Greenhill, Catherine

McKay, Brendan

Publisher

Elsevier

Abstract

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

Keywords

Keywords: Asymptotic enumeration; Column sums; Contingency tables; Non-negative integer matrices; Non-negative integers; Switchings; Matrix algebra Asymptotic enumeration; Contingency tables; Non-negative integer matrices; Switchings

URI

http://hdl.handle.net/1885/39073

Collections

ANU Research Publications

Source

Advances in Applied Mathematics

Type

Journal article

DOI

10.1016/j.aam.2008.01.002

Restricted until

2037-12-31

Downloads

File

Description

01_Greenhill_Asymptotic_enumeration_of_2008.pdf (223.04 KB)

abcd