๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Bell numbers and k-trees

โœ Scribed by Winston Yang


Book ID
103062476
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
229 KB
Volume
156
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis


We show that the number of partitions of { 1, ..., n} with the restriction that each integer i is not in the same part as i -1 is the Bell number B,_ 1. We generalize this result to partitions of the vertices of k-trees.


๐Ÿ“œ SIMILAR VOLUMES


Bell numbers, determinants and series
โœ P K SAIKIA, DEEPAK SUBEDI ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Indian Academy of Sciences ๐ŸŒ English โš– 216 KB
Postorder trees and Eulerian numbers
โœ Thomas P. Whaley ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 361 KB
Search trees and Stirling numbers
โœ A.H. Manob; T.M. Islam; M.T. Parvez; M. Kaykobad ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 325 KB
Engel's inequality for bell numbers
โœ E.Rodney Canfield ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 155 KB
Tree graphs and tree numbers
โœ Krishnamoorthy, M.; Deo, N. ๐Ÿ“‚ Article ๐Ÿ“… 1975 ๐Ÿ› IEEE โš– 390 KB