A Note on Combinations
Canadian mathematical bulletin, Tome 9 (1966) no. 5, pp. 675-677
Voir la notice de l'article provenant de la source Cambridge University Press
We call k integers x1 < x2 ... < xk chosen from 1, 2, ..., n} a k-choice (combination) from n. With 1, 2, ..., n arranged in a circle, so that 1 and n are consecutive, we have a circular k-choice from n. A part of a k-choice from n is a sequence of consecutive integers not contained in a longer one. Let denote the number of circular k-choices from n with exactly r parts all ≤ w.
Abramson, M.; Moser, W. A Note on Combinations. Canadian mathematical bulletin, Tome 9 (1966) no. 5, pp. 675-677. doi: 10.4153/CMB-1966-082-5
@article{10_4153_CMB_1966_082_5,
author = {Abramson, M. and Moser, W.},
title = {A {Note} on {Combinations}},
journal = {Canadian mathematical bulletin},
pages = {675--677},
year = {1966},
volume = {9},
number = {5},
doi = {10.4153/CMB-1966-082-5},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-082-5/}
}
[1] 1. Abramson, M., Restricted choices. Canad. Math. Bull. 8 (1965) 585-600. Google Scholar
[2] 2. Abramson, M. and Moser, W., Combinations, successions and the n-kings problem. Math. Mag. Google Scholar
[3] 3. Riordan, J., Permutations without 3-sequences. Bull. Amer. Math. Soc. 51 (1945) 745-48. Google Scholar
[4] 4. Riordan, J., An Introduction to Combinatorial Analysis. New York, 1958. Google Scholar
Cité par Sources :