Algebraic enumeration

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 01:10, 9 February 2015 (rm orphan tag). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.


Stub icon

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Algebraic_enumeration&oldid=646270450"