Geodesic
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 University Press

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.
DOI : 10.4153/CMB-1983-050-4
Mots-clés : 05A17 
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/}
}
TY  - JOUR
AU  - Prodinger, Helmut
TI  - Ordered Fibonacci Partitions
JO  - Canadian mathematical bulletin
PY  - 1983
SP  - 312
EP  - 316
VL  - 26
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1983-050-4/
DO  - 10.4153/CMB-1983-050-4
ID  - 10_4153_CMB_1983_050_4
ER  - 
%0 Journal Article
%A Prodinger, Helmut
%T Ordered Fibonacci Partitions
%J Canadian mathematical bulletin
%D 1983
%P 312-316
%V 26
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1983-050-4/
%R 10.4153/CMB-1983-050-4
%F 10_4153_CMB_1983_050_4

[1] 1. Bartholemy, J. P., An asymptotic equivalent for the number of total preorders on a finite set, Discrete Mathematics 29 (1980), 311-313. Google Scholar

[2] 2. Comtet, L., Advanced Combinatorics, Reidel, D., Dordrecht (1974). Google Scholar

[3] 3. Gross, O. A., Preferential arrangements, American Math. Monthly, 69 (1962), 4-8. Google Scholar

[4] 4. Henrici, P., Applied and Computational Complex Analysis, Vol. 2, John Wiley, New York and Toronto (1974). Google Scholar

[5] 5. James, R. D., The factors of a squarefree integer, Canad. Math. Bull. 10 (1968), 733-735. Google Scholar

[6] 6. Rota, G.-C., The number of partitions of a set, American Math. Monthly, 71 (1964); reprinted in G.-C. Rota: Finite Operator Calculus, Academic Press, New York (1975). Google Scholar

[7] 7. Prodinger, H., On the number of Fibonacci partitions of a set, The Fibonacci Quarterly 19 (1981), 463-466. Google Scholar

[8] 8. Prodinger, H., Analysis of an algorithm to construct Fibonacci partitions, R.A.I.R.O., Theoretical Informatics, to appear. Google Scholar

[9] 9. Tanny, S. M., On some numbers related to the Bell numbers, Canad. Math. Bull. 17 (1975), 733-738. Google Scholar

Cité par Sources :