Symbolic method (combinatorics): Difference between revisions

Revision as of 05:52, 12 January 2015

Revision as of 05:58, 12 January 2015

Line 318:

:<math>A_{min}(Z)=A_{max}(Z)=\int^{z}_{0}B'(t)C(t)dt.</math>

or says,

:<math>\frac{dA_{min}(Z)}{z}=\frac{A_dA_{max}(Z)}{z}=\frac{dB(t)}{z}C(t).</math>

===Example===

An increasing Cayley tree is a labelled non-plane and rooted tree whose labels along any branch stemming from the root form an increasing sequence. Then, let <math>\mathcal{L}</math> be the class of such trees. The recursive specification is now <math>\mathcal{L}=\mathcal{Z}^\square\star SET(\mathcal{L}).</math>

===Other elementary constructions===