On the number of combinations without certain separations (Q925023)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of combinations without certain separations |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of combinations without certain separations |
scientific article |
Statements
On the number of combinations without certain separations (English)
0 references
29 May 2008
0 references
The authors enumerate combinatorially the number of ways of selecting \(k\) objects from \(n\) objects arrayed in a line (respectively in a circle), such that no two selected ones are separated by \(m-1\), \(2m-1, \dots,pm-1\) objects. These results generalize respective ones of \textit{I. Kaplansky} [Bull. Am. Math. Soc. 49, 784--785 (1943; Zbl 0060.02904)] and \textit{J. Konvalina} [J. Comb. Theory, Ser. A 31, 101--107 (1981; Zbl 0469.05003)].
0 references
number of combinations
0 references
0.833286702632904
0 references
0.8233311772346497
0 references
