Revision as of 03:13, 1 August 2019 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits No edit summary ← Previous edit		Revision as of 03:18, 1 August 2019 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits →Example Next edit →
Line 336: ===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 \operatorname{SET}(\mathcal{L}).</math> ===Other elementary constructions===

Symbolic method (combinatorics): Difference between revisions