Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T12:55:33.977Z Has data issue: false hasContentIssue false

Note on the combinatorial formula for nHr

Published online by Cambridge University Press:  09 April 2009

G. Baikunth Nath
Affiliation:
Department of Mathematics, University of Queensland, Australia
P. V. Krishna Iyer
Affiliation:
Department of Mathematics, University of Queensland, Australia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

nHr denotes the number of n × n matrices with non-negative integral entries, with row-sums and column-sums all equal to r. Kenji Mano [3] investigated the number nHr in which n distinct objects each replicated r times can be distributed in equal numbers among n cells. He gives an intricate formula for the case r = 2. Recently, Anand et al. [1], making use of partitions, extended it to 3Hr and stated a plausible formula for nHr.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1972