| |
| | Dictionary of Combinatorics -- S |
 | | There need not be an identity element (as there must be in a monoid), nor is there a requirement that every element must have an inverse (as there is in a group), indeed, without an identity the existance of inverses becomes impossible to define. |
 | | The Stirling numbers of the second kind, S(n,t), have the combinatorial interpretation of counting the number of ways of partitioning an n element set into t non-empty subsets. |
 | | The Stirling numbers of the first kind, s(n,t), are the coefficients on the monomials in an expansion of polynomials of the form |
| www.southernct.edu /~fields/comb_dic/S.html (533 words) |
|