Hostname: page-component-848d4c4894-wg55d Total loading time: 0 Render date: 2024-05-21T06:03:34.966Z Has data issue: false hasContentIssue false
  • English
  • Français

A New Identity and Some Applications

Published online by Cambridge University Press:  20 November 2018

W. O. J. Moser  and
Richard Pollack
W. O. J. Moser
Affiliation:
Department of Mathematics Burnside Hall Mcgill University, Montreal, Que H3A2K6
Richard Pollack
Affiliation:
McGill University, New York University, Courant Institute of Mathematical Sciences
Rights & Permissions [Opens in a new window]

Abstract

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.

Let (n|k) denote the number of k-choices 1≤x1<x2<…<xk≤n satisfying xi-xi-1≥2, i = 2,…, k, n + x1-xk≥2; let (m, n | k) = Σi+j=k (m | i)(n | j). Several elementary proofs of the new identity (m, n|k) = (m + n | k) if 0≤k<m≤n. and

if 0≤m≤n, m≤k, are given. Generalizations and applications are considered.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 23 , Issue 3 , 01 September 1980 , pp. 281 - 290
Copyright
Copyright © Canadian Mathematical Society 1980

References

1. Riordan, J., An Introduction to Combinatorial Analysis, Wiley, New York, 1958.Google Scholar
2. Moser, W. O. J. and Abramson, Morton, Enumeration of combinations with restricted differences and cospan, J. Comb. Theory 7 (1969), 162-170.Google Scholar
3. Gould, H.W., Some generalizations of Vandermonde's convolution, Amer. Math. Monthly 63 (1956), 84-91.Google Scholar
4. Gould, H.W., Final analysis of Vandermonde's convolution, Amer. Math. Monthly 64 (1957), 409-415.Google Scholar
5. Hall, M. Jr., Combinatorial Theory, Blaisdell, Toronto, 1967.Google Scholar
6. Lyness, R. C., Al Capone and the death ray, Math. Gazette 25 (1941), 283-287.Google Scholar
7. Mohanty, S.G., Lattice path counting and applications, Report No. 95, Dept. Math., McMaster University, 1977.Google Scholar
8. Touchard, J., Sur un probl?me de permutations, Comptes Rendus 198 (1934), 631-633.Google Scholar
9. Rothe, H.A., Dissertation, Leipzig, 1793.Google Scholar
10. Raney, G.N., Functional composition patterns and power series reversion, Trans. Amer. Math. Soc. 94 (1960), 441-451.Google Scholar
11. van Lint, J. H., Combinatorial Theory Seminar, Springer Lecture Notes No. 382, 1974.Google Scholar