Partitions and Clifford algebras

René Schott (1, 2) , George Stacey Staples (3)

1 IECN - Institut Élie Cartan de Nancy
2 TRIO - Real time and interoperability
3 Department of Mathematics and Statistics - Southern Illinois University

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 . The result is recovery of Stirling numbers of the second kind, Bell numbers, and Bessel numbers.

Domaines: Probabilités [math.PR]

René Schott, George Stacey Staples. Partitions and Clifford algebras. European Journal of Combinatorics, 2008, 29 (5), pp.1133-1138. ⟨10.1016/j.ejc.2007.07.003⟩. ⟨hal-00168339⟩