Six etudes in generating functions

DOI10.1080/00207168908803760zbMath0689.05003OpenAlexW2121499799MaRDI QIDQ4207899

Doron Zeilberger

Publication date: 1989

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168908803760

zbMATH Keywords

Catalan numbergenerating functionscombinatorial enumerationformal languagesordered treesDyck wordslegal bracketingsballot sequencesdiagonalization of polygons

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items

The statistic ``number of udu's in Dyck paths, The Narayana distribution, Counting pairs of nonintersecting lattice paths with respect to weighted turns, A bijective proof of an enumerative property of legal bracketings, A bijection on Dyck paths and its consequences, Catalan path statistics having the Narayana distribution, Sur les polynômes de Catalan simples et doubles. (On simple and double Catalan polynomials), A bijection on ordered trees and its consequences, Short and long ranged adsorption of directed paths, Identities from weighted Motzkin paths, Context-free grammars, differential operators and formal power series, Narayana polynomials and Hall-Littlewood symmetric functions, A symmetric variation of a distribution of Kreweras and Poupard, Noncrossing normal ordering for functions of boson operators, Weakly increasing trees on a multiset, A bijection between ordered trees and bicoloured ordered trees, Dyck path enumeration, Constraint-sensitive Catalan path statistics having the Narayana distribution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new enumerative property of the Narayana numbers
• Enumerations of ordered trees
• Algebraic languages and polyominoes enumeration
• A Proof of Kirkman's Hypothesis
• On context-free languages and push-down automata