| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654816 | European Journal of Combinatorics | 2008 | 6 Pages |
Abstract
Given the set [n]={1,â¦,n} for positive integer n, combinatorial properties of Clifford algebras are exploited to count partitions and non-overlapping partitions of [n]. The result is recovery of Stirling numbers of the second kind, Bell numbers, and Bessel numbers.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
René Schott, G. Stacey Staples,