Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

EJC
2008

favoriteEmaildiscussreport

88views Information Technology» more EJC 2008»

Partitions and Clifford algebras

13 years 11 months ago

Partitions and Clifford algebras

Download www.loria.fr

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

René Schott, G. Stacey Staples

Real-time Traffic

Clifford Algebras | Combinatorial Properties | EJC 2007 | EJC 2008 | Information Technology | Positive Integer |

claim paper

Related Content

» Clifford algebras and approximating the permanent

» An Example of Clifford Algebras Calculations with GiNaC

» Sizing a Serial Chain to Fit a Task Trajectory Using Clifford Algebra Exponentials

» Highrate DoubleSymbolDecodable STBCs from Clifford Algebras

» MultigroupDecodable STBCs from Clifford Algebras

» Highrate MultiSymbolDecodable STBCs from Clifford Algebras

» Clifford algebra Lorentzian geometry and rational parametrization of canal surfaces

» The Lie Model for Euclidean Geometry

» Clifford Convolution And Pattern Matching On Vector Fields

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	EJC
Authors	René Schott, G. Stacey Staples

Comments (0)