Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-13T03:24:00.606Z Has data issue: false hasContentIssue false
  • English
  • Français

Note on the combinatorial formula for nHr

Published online by Cambridge University Press:  09 April 2009

G. Baikunth Nath  and
P. V. Krishna Iyer
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.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 14 , Issue 3 , November 1972 , pp. 264 - 268
Copyright
Copyright © Australian Mathematical Society 1972

References

[1]Anand, H., Dumir, V. C. and Gupta, H., ‘A Combinatorial Distribution Problem’, Duke Math. J. 33 (1966), 757–769.Google Scholar
[2]David, F. N., and Kendall, M. G., ‘Tables of Symmetric Functions: Part IV’, Biometrika 40 (1953), 427–446.Google Scholar
[3]Mano, Kenji, ‘On the formula of nHr’, Scientific Reports of the Faculty of Literature and Science: Hirosaki University 8 (1961), 58–60.Google Scholar