Algebraic enumeration

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.[1]

References

  1. ↑ Gessel, Ira M.; Stanley, Richard P. (1995), "Algebraic enumeration", Handbook of combinatorics, Vol. 1, 2, Amsterdam: Elsevier, pp. 1021–1061, MR 1373677.


This article is issued from Wikipedia - version of the Monday, February 09, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.