Symbolic method (combinatorics): Difference between revisions

Content deleted Content added
CyborgTosser (talk | contribs)
CyborgTosser (talk | contribs)
Line 133:
 
===Cycle===
Cycles are also easier than in the unlabelled case. A cycle of length <math>k</math> corresponds to <math>k</math> distinct sequences. Thus for <math>\mathcal{A} = \mathfrak{C}\{\mathcal{B}\}</math>, we have
:<math>A(z) = \sum_{k = 0}^{\infty} \frac{B(z)^k}{k} = \ln(\frac{1}{1-B(z)})</math>
 
===Other elementary constructions===
===Examples===