Ordered Fibonacci Partitions
Canadian mathematical bulletin, Tome 26 (1983) no. 3, pp. 312-316
Voir la notice de l'article provenant de la source Cambridge
Ordered partitions are enumerated by Fn = Σk k !S(n, k) where S(n, k) is the Stirling number of the second kind. We give some comments on several papers dealing with ordered partitions and turn then to ordered Fibonacci partitions of {1, ߪ, n}: If d is a fixed integer, the sets A appearing in the partition have to fulfill i, j ∈ A, i ≠ j ⟹ |i-j| ≥ d. The number of ordered Fibonacci partitions is determined.
Prodinger, Helmut. Ordered Fibonacci Partitions. Canadian mathematical bulletin, Tome 26 (1983) no. 3, pp. 312-316. doi: 10.4153/CMB-1983-050-4
@article{10_4153_CMB_1983_050_4,
author = {Prodinger, Helmut},
title = {Ordered {Fibonacci} {Partitions}},
journal = {Canadian mathematical bulletin},
pages = {312--316},
year = {1983},
volume = {26},
number = {3},
doi = {10.4153/CMB-1983-050-4},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1983-050-4/}
}
Cité par Sources :