Bell numbers and \(k\)-trees (Q1923519)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bell numbers and \(k\)-trees |
scientific article |
Statements
Bell numbers and \(k\)-trees (English)
0 references
13 November 1996
0 references
The author shows that the number of partitions of \(\{1,2,\dots,n\}\) such that if \(0<|i-j|\leq a\) then \(i\) and \(j\) belong to different blocks is the Bell number \(B_{n-a}\).
0 references
\(k\)-trees
0 references
partitions
0 references
Bell number
0 references
