https://wiki.sarg.dev/api.php?action=feedcontributions&feedformat=atom&user=76.126.130.18Vero - Wikipedia - User contributions [en]2026-07-12T21:44:39ZUser contributionsMediaWiki 1.44.2https://wiki.sarg.dev/index.php?title=Algebraic_enumeration&diff=147273Algebraic enumeration2025-03-23T03:48:47Z<p>76.126.130.18: capitalize and link Laurent series</p>
<hr />
<div>'''Algebraic enumeration''' is a subfield of [[enumeration]] that deals with finding exact formulas for the number of [[combinatorics|combinatorial objects]] of a given type, rather than estimating this number [[asymptotic analysis|asymptotically]]. Methods of finding these formulas include [[generating function]]s and the solution of [[recurrence relation]]s. The field involves bijections, power series and formal [[Laurent series]]. <ref>{{citation<br />
| last1 = Gessel | first1 = Ira M.<br />
| last2 = Stanley | first2 = Richard P. | author2-link = Richard P. Stanley<br />
| contribution = Algebraic enumeration<br />
| location = Amsterdam<br />
| mr = 1373677<br />
| pages = 1021–1061<br />
| publisher = Elsevier<br />
| title = Handbook of combinatorics, Vol. 1, 2<br />
| year = 1995}}.</ref><br />
<br />
==References==<br />
{{reflist}}<br />
<br />
[[Category:Enumerative combinatorics]]<br />
<br />
<br />
{{combin-stub}}</div>76.126.130.18