Symbolic method (combinatorics): Difference between revisions

Revision as of 00:28, 16 March 2018

Revision as of 01:44, 3 May 2018

Line 2:

and is detailed in Part A of his book with [[Robert Sedgewick (computer scientist)|Robert Sedgewick]], ''Analytic Combinatorics''.

Similar languages for specifying combinatorial classes and their generating functions are found in work by

Bender and Goldman<ref>{{cite journal|last1=Bender|first1=E.A.|last2=Goldman|first2=J.R.|title=Enumerative uses of generating functions|journal=Indiana Univ. Math. J.|date=1971|volume=20|pages=753-764}}</ref>, Foata and Schuetzenberger<ref name="fs">{{cite journal|last1=Foata|first1=D.|last2=SchuetzenbergerSchützenberger|first2=M.|title=Théorie géométrique des polynômes Eulériens|journal=Lectures Notes in Math.|date=1970|volume=138}}</ref>, and Joyal<ref>{{cite journal|last1=Joyal|first1=Andre|title=Une théorie combinatoire des séries formelles|journal=Adv. Math.|date=1981|volume=42|pages=1-82|ref=joy}}</ref>.

The presentation in this article borrows somewhat from Joyal's [[combinatorial species]].