Algebraic enumeration
From Infogalactic: the planetary knowledge core
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
- ↑ Lua error in package.lua at line 80: module 'strict' not found..
<templatestyles src="Asbox/styles.css"></templatestyles>
.svg){kind=small} |
This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |
