Selecting k objects from a cycle with p pairs of separation s (Q797581)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3867336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Selecting k objects from a cycle with p pairs of separation s |
scientific article; zbMATH DE number 3867336 |
Statements
Selecting k objects from a cycle with p pairs of separation s (English)
0 references
1984
0 references
Generalizing a result of \textit{J. Konvalina} [ibid. 31, 101-107 (1981; Zbl 0469.05003)], the author determines the number of ways a k-element subset can be chosen from a cyclically ordered n-set without two points of distance \(s\geq 1\). For \(n\geq 1+km\) where \(m=(s,n)\), the formula reduces to \((n/k)\binom{n-k-1}{k-1}.\)
0 references
cyclically ordered set
0 references
subset
0 references
0.80127573
0 references
0.7992097
0 references
0.7988183
0 references
