Context-free grammars, generating functions and combinatorial arrays

DOI10.1016/j.ejc.2019.02.007zbMath1412.68121OpenAlexW2921832688WikidataQ128272363 ScholiaQ128272363MaRDI QIDQ2422224

Bao-Xuan Zhu, Yeong-Nan Yeh, Qinglin Lu

Publication date: 18 June 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2019.02.007

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial inequalities (05A20) Recurrences (11B37) Grammars and rewriting systems (68Q42)

Related Items (2)

The Dumont ansatz for the Eulerian polynomials, peak polynomials and derivative polynomials ⋮ A generalized Eulerian triangle from staircase tableaux and tree-like tableaux

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Context-free grammars for permutations and increasing trees
• Log-convexity and strong \(q\)-\(\log\)-convexity for some triangular arrays
• Enumeration of permutations by number of alternating runs
• Tree-like tableaux
• An explicit formula for the number of permutations with a given number of alternating runs
• The structure of alternative tableaux
• Schur positivity and the \(q\)-log-convexity of the Narayana polynomials
• Derivative polynomials and enumeration of permutations by number of interior and left peaks
• Context-free grammars, differential operators and formal power series
• Log-convex and Stieltjes moment sequences
• The \(q\)-log-convexity of the Narayana polynomials of type \(B\)
• Log-concavity and LC-positivity
• Linear transformations preserving the strong \(q\)-log-convexity of polynomials
• Enumeration of permutations by number of alternating descents
• William Chen grammars and derivations in trees and arborescences
• A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs
• \(q\)-log-convexity from linear transformations and polynomials with only real zeros
• Context-free grammars for several polynomials associated with Eulerian polynomials
• Polynomials with real zeros and Pólya frequency sequences
• Ramanujan grammar and Cayley trees
• Context-free grammars for triangular arrays
• A unified approach to polynomial sequences with only real zeros
• On the log-convexity of combinatorial sequences
• Counting permutations by their alternating runs
• Total positivity for cominuscule Grassmannians.
• Some combinatorial arrays generated by context-free grammars
• Strong \(q\)-log-convexity of the Eulerian polynomials of Coxeter groups
• Central and local limit theorems applied to asymptotic enumeration
• A note on concavity properties of triangular arrays of numbers
• Recurrence Relations for Strongly q-Log-Convex Polynomials
• Combinatorics of Permutations
• ON -VECTORS AND THE DERIVATIVES OF THE TANGENT AND SECANT FUNCTIONS
• Enumeration of snakes and cycle-alternating permutations
• ENUMERATION OF A DUAL SET OF STIRLING PERMUTATIONS BY THEIR ALTERNATING RUNS
• Some positivities in certain triangular arrays
• Positivity of Iterated Sequences of Polynomials
• Log-concavity and strong q-log-convexity for Riordan arrays and recursive matrices
• CONJECTURES INVOLVING ARITHMETICAL SEQUENCES
• Descent numbers and major indices for the hyperoctahedral group

This page was built for publication: Context-free grammars, generating functions and combinatorial arrays