Symbolic method (combinatorics): Difference between revisions

Content deleted Content added
CyborgTosser (talk | contribs)
added section for labelled structures
CyborgTosser (talk | contribs)
Line 102:
 
==Labelled structures==
An object is ''weakly labelled'' if each of its atoms has a nonnegative integer label, and each of these labels is distinct. An object is (''strongly'' or ''well'') ''labelled'', if furthermore, these labels comprise the consecutive integers <math>[1 \ldots n]</math>. ''Note: some combinatorial classes are best specified as labelled structures or unlabelled structures, but some readily admit both specifications.'' A good example of labelled structures is the class of [[Graph (mathematics)|labelled graph]]s.
 
With labelled structures, an [[exponential generating function]] (EGF) is used. The EGF of a sequence <math>A_{n}</math> is defined as
:<math>A(x)=\sum_{n=0}^{\infty}A_{n}\frac{x^{n}}{n!}</math>
 
===Product===
For labelled structures, we must use a different definition for product than for unlabelled structures. In fact, if we simply used the cartesian product, the resulting structures would not even be well labelled.
 
===Sequence===
===Set===