Context-free grammars, differential operators and formal power series
From MaRDI portal
Publication:688685
DOI10.1016/0304-3975(93)90307-FzbMath0788.68082OpenAlexW2143170067MaRDI QIDQ688685
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
Stirling numberssymmetric functionsBell polynomialsLagrange inversion formulacontext-free grammarformal languageFaà di Bruno's formulaCayley's formula on labeled treesexponential formal power seriesformal derivativegrammatical calculus
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Formal languages and automata (68Q45) Formal power series rings (13F25)
Related Items
On the \(\gamma\)-positivity of multiset Eulerian polynomials ⋮ Unnamed Item ⋮ Context-free grammars for permutations and increasing trees ⋮ The combinatorial power of the companion matrix ⋮ ON -VECTORS AND THE DERIVATIVES OF THE TANGENT AND SECANT FUNCTIONS ⋮ A context-free grammar for peaks and double descents of permutations ⋮ Cyclic Tableaux and Symmetric Functions ⋮ A new approach to the \(r\)-Whitney numbers by using combinatorial differential calculus ⋮ Eulerian polynomials, Stirling permutations of the second kind and perfect matchings ⋮ Enumeration of permutations by number of alternating runs ⋮ Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers ⋮ The Dumont ansatz for the Eulerian polynomials, peak polynomials and derivative polynomials ⋮ Context-free grammars, generating functions and combinatorial arrays ⋮ A grammatical calculus for peaks and runs of permutations ⋮ Stirling permutation codes ⋮ Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees ⋮ Unnamed Item ⋮ Triangular recurrences, generalized Eulerian numbers, and related number triangles ⋮ Excedance-type polynomials, gamma-positivity and alternatingly increasing property ⋮ Eulerian polynomials and the 𝑔-indices of Young tableaux ⋮ Context-free grammars for several polynomials associated with Eulerian polynomials ⋮ \(q\)-Stirling identities revisited ⋮ ENUMERATION OF A DUAL SET OF STIRLING PERMUTATIONS BY THEIR ALTERNATING RUNS ⋮ Unnamed Item ⋮ On certain combinatorial expansions of the Legendre-Stirling numbers ⋮ The ascent-plateau statistics on Stirling permutations ⋮ A context-free grammar for the \(e\)-positivity of the trivariate second-order Eulerian polynomials ⋮ A bijective proof of the Shor recurrence ⋮ Several variants of the Dumont differential system and permutation statistics ⋮ Context-free grammars for triangular arrays ⋮ A context-free grammar for the Ramanujan-Shor polynomials ⋮ Bijections behind the Ramanujan polynomials ⋮ Some combinatorial arrays generated by context-free grammars ⋮ Statistics on multipermutations and partial \(\gamma\)-positivity ⋮ Joint distributions of permutation statistics and the parabolic cylinder functions ⋮ Jacobian elliptic functions and a family of bivariate peak polynomials ⋮ David-Barton type identities and alternating run polynomials ⋮ Context-Free Grammars and Stable Multivariate Polynomials over Stirling Permutations ⋮ Alternating Eulerian polynomials and left peak polynomials ⋮ \(\gamma\)-positivity and partial \(\gamma\)-positivity of descent-type polynomials ⋮ On apolarity and generic canonical forms ⋮ The \(1/k\)-Eulerian polynomials of type \(B\) ⋮ Normal ordering problem and the extensions of the Stirling grammar ⋮ Some combinatorial arrays related to the Lotka-Volterra system
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A combinatorial proof of Newton's identities
- Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
- Une théorie combinatoire des séries formelles
- Lattice path enumeration by formal schema
- Formal languages and enumeration
- Algebraic languages and polyominoes enumeration
- Interpolation and Combinatorial Functions
- A general bijective algorithm for trees.
- The Formula of FAA Di Bruno
- Coalgebras and Bialgebras in Combinatorics
- Formulae for high derivatives of composite functions
- Six etudes in generating functions
- Functional Composition Patterns and Power Series Reversion
- Derivatives of composite functions