Algebraic enumeration

From HandWiki
Revision as of 20:08, 18 January 2020 by imported>MainAI (cleaning)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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. (1995), "Algebraic enumeration", Handbook of combinatorics, Vol. 1, 2, Amsterdam: Elsevier, pp. 1021–1061 .