Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-24T21:34:02.045Z Has data issue: false hasContentIssue false

Permanents, matchings and Latin rectangles

Published online by Cambridge University Press:  17 April 2009

Ian M. Wanless
Affiliation:
Department of Mathematics and Statistics, University of Melbourne, Parkville Vic 3052, Australia e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Abstracts of Australasian Ph.D. Theses
Copyright
Copyright © Australian Mathematical Society 1999

References

[1]Brègman, L.M., ‘Some properties of nonnegative matrices and their permanents’, Soviet Math. Dokl. 14 (1973), 945949.Google Scholar
[2]Doković, D.Ž., ‘On a conjecture by van der Waerden’, Mat. Vesnik 19 (1967), 566569.Google Scholar
[3]Godsil, C.D. and McKay, B.D., ‘Asymptotic enumeration of Latin rectangles’, J. Combin. Theory. Ser. B 48 (1990), 1944.CrossRefGoogle Scholar
[4]Holens, F., Two aspects of doubly stochastic matrices: Permutation matrices and the minimum permanent function, Ph.D. Thesis (University of Manitoba, 1964).Google Scholar
[5]McKay, B.D. and Wanless, I.M., ‘Maximising the permanent of (0, 1)-matrices and the number of extensions of Latin rectangles’, Electron. J. Combin. 5 (1998), R11.CrossRefGoogle Scholar
[6]Minc, H., ‘Theory of permanents 1982–1985’, Linear and Multilinear Algebra 21 (1987), 109148.CrossRefGoogle Scholar
[7]Wanless, I.M., ‘Jerrum's multistorey carpark’, Austral. Math. Soc. Gaz. 23 (1996), 193197.Google Scholar