Algebraic enumeration is a subfield of enumeration that deals with finding exact formulas for the number of combinatorial objects of a given type, rather than estimating this number asymptotically. Methods of finding these formulas include generating functions and the solution of recurrence relations. The field involves bijections, power series and formal laurent series. [1]
References edit
- ^ Gessel, Ira M.; Stanley, Richard P. (1995), "Algebraic enumeration", Handbook of combinatorics, Vol. 1, 2, Amsterdam: Elsevier, pp. 1021–1061, MR 1373677.
.svg){kind=small} | This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |