Symbolic method (combinatorics)

This is an old revision of this page, as edited by CyborgTosser (talk | contribs) at 05:23, 15 September 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Analytic combinatorics is a sub-branch of combinatorics that describes combinatorial classes using generating functions, which are often analytic functions, but sometimes formal power series.

Two types of generating functions are commonly used — ordinary andsoxed ciorial clnerating function]]s, TwAn important tec )ge for deriving generating functions is symbolic combinatorics.

Given a generating function, analytic combinatorics attempts to [[Oimt] toctiog funsis|imt] toctiobehaviorion

Taon,unven asepornceal class]ahoan,unven aseptopshbqh: This, whichinvolv].

funsis|

Tao [[generati'funcSlasularity (mao [mao co)|sg [[f

[[Category:unctions is [[s