Partitions and Clifford algebras

Given the set [n] = {1, . . . , n} for positive integer n, combinatorial properties of Clifford algebras are exploited to count partitions and nonoverlapping partitions of [n]. The result is recovery of Stirling numbers of the second kind, Bell numbers, and Bessel numbers. AMS subject classification: 05A18, 11B73, 15A66

• Type: Journal
• Year: 2008
• Where: EJC
• Authors: René Schott, G. Stacey Staples
• Keywords: Clifford Algebras, Combinatorial Properties, EJC 2007, EJC 2008, Information Technology, Positive Integer