Context-free grammars, differential operators and formal power series

DOI10.1016/0304-3975(93)90307-FMaRDI QIDQ688685zbMATH OpenOpenAlexFDO

Authors William Y. C. Chen

Publication date 6 December 1993

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(93)90307-f

zbMATH Keywords

context-free grammarsymmetric functionsformal languageLagrange inversion formulaStirling numbersBell polynomialsCayley's formula on labeled treesexponential formal power seriesformal derivativegrammatical calculusFaà di Bruno's formula

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Formal power series rings (13F25)

Recommendations

• The formal derivative operator and multifactorial numbers
• Context-free series on trees
• William Chen grammars and derivations in trees and arborescences
• STACS 2005
• Formulae and asymptotics for coefficients of algebraic functions

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 4008397 (Why is no real title available?)
• scientific article; zbMATH DE number 3758344 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3513784 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• A combinatorial proof of Newton's identities
• A general bijective algorithm for trees.
• Algebraic languages and polyominoes enumeration
• Coalgebras and Bialgebras in Combinatorics
• Derivatives of composite functions
• Formal languages and enumeration
• Formulae for high derivatives of composite functions
• Functional Composition Patterns and Power Series Reversion
• Interpolation and Combinatorial Functions
• Lattice path enumeration by formal schema
• Six etudes in generating functions
• The Formula of FAA Di Bruno
• Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
• Une théorie combinatoire des séries formelles

Cited in

(52)

• Statistics on multipermutations and partial \(\gamma\)-positivity
• \(\gamma\)-positivity and partial \(\gamma\)-positivity of descent-type polynomials
• The binomial-Stirling-Eulerian polynomials
• A context-free grammar for peaks and double descents of permutations
• Context-free grammars for several polynomials associated with Eulerian polynomials
• On the \(\gamma\)-positivity of multiset Eulerian polynomials
• A context-free grammar for the \(e\)-positivity of the trivariate second-order Eulerian polynomials
• The ascent-plateau statistics on Stirling permutations
• A bijective proof of the Shor recurrence
• scientific article; zbMATH DE number 7644296 (Why is no real title available?)
• Enumeration of permutations by number of alternating runs
• Several variants of the Dumont differential system and permutation statistics
• A context-free grammar for the Ramanujan-Shor polynomials
• Context-free grammars for triangular arrays
• Combinatorial differential operators in: Faà di Bruno formula, enumeration of ballot paths, enriched rooted trees and increasing rooted trees
• On \(\gamma\)-vectors and the derivatives of the tangent and secant functions
• Some combinatorial arrays generated by context-free grammars
• On the joint distributions of succession and Eulerian statistics
• More bijective combinatorics of weakly increasing trees
• Context-free series on trees
• Context-free grammars for permutations and increasing trees
• Jacobian elliptic functions and a family of bivariate peak polynomials
• Triangular recurrences, generalized Eulerian numbers, and related number triangles
• Stirling permutation codes
• A \(q\)-analog of the Stirling-Eulerian polynomials
• Context-Free Grammars and Stable Multivariate Polynomials over Stirling Permutations
• On apolarity and generic canonical forms
• Excedance-type polynomials, gamma-positivity and alternatingly increasing property
• Eulerian polynomials and the 𝑔-indices of Young tableaux
• Joint distributions of permutation statistics and the parabolic cylinder functions
• scientific article; zbMATH DE number 7599682 (Why is no real title available?)
• Eulerian polynomials, Stirling permutations of the second kind and perfect matchings
• The Dumont ansatz for the Eulerian polynomials, peak polynomials and derivative polynomials
• A new approach to the \(r\)-Whitney numbers by using combinatorial differential calculus
• Alternating Eulerian polynomials and left peak polynomials
• The \(1/k\)-Eulerian polynomials of type \(B\)
• A grammatical calculus for peaks and runs of permutations
• Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers
• The combinatorial power of the companion matrix
• Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees
• Enumeration of a dual set of Stirling permutations by their alternating runs
• David-Barton type identities and alternating run polynomials
• The formal derivative operator and multifactorial numbers
• Generating functions for the cd-indices of simplices and cubes
• \(q\)-Stirling identities revisited
• Cyclic Tableaux and Symmetric Functions
• On certain combinatorial expansions of the Legendre-Stirling numbers
• Normal ordering problem and the extensions of the Stirling grammar
• Context-free grammars, generating functions and combinatorial arrays
• scientific article; zbMATH DE number 4089635 (Why is no real title available?)
• Bijections behind the Ramanujan polynomials
• Some combinatorial arrays related to the Lotka-Volterra system

This page was built for publication: Context-free grammars, differential operators and formal power series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688685)