Context-Free Grammars and Stable Multivariate Polynomials over Stirling Permutations
From MaRDI portal
Publication:3387104
Cites work
- A unified approach to polynomial sequences with only real zeros
- Applications of stable polynomials to mixed determinants: Johnson's conjectures, unimodality, and symmetrized Fischer products
- Context-free grammars for permutations and increasing trees
- Context-free grammars, differential operators and formal power series
- Fishburn diagrams, Fishburn numbers and their refined generating functions
- Generalized Stirling permutations, families of increasing trees and urn models
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- Legendre-Stirling permutations
- Multivariate Eulerian polynomials and exclusion processes
- Multivariate stable polynomials: theory and applications
- On the monotone column permanent conjecture
- Plane recursive trees, Stirling permutations and an urn model
- Pólya-Schur master theorems for circular domains and their boundaries
- Real zeros and normal distribution for statistics on Stirling permutations defined by Gessel and Stanley
- Stable multivariate \(W\)-Eulerian polynomials
- Stable multivariate Eulerian polynomials and generalized Stirling permutations
- Stirling Behavior is Asymptotically Normal
- Stirling polynomials
- The blossoming of Schröder's fourth problem
- The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
- The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications
- The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
- Unimodal, log-concave and Pólya frequency sequences in combinatorics
- William Chen grammars and derivations in trees and arborescences
Cited in
(17)- Statistics on multipermutations and partial \(\gamma\)-positivity
- A context-free grammar for the \(e\)-positivity of the trivariate second-order Eulerian polynomials
- \(\gamma\)-positivity and partial \(\gamma\)-positivity of descent-type polynomials
- Normal ordering problem and the extensions of the Stirling grammar
- Some combinatorial arrays generated by context-free grammars
- Enumeration of permutations by number of alternating runs
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
- Multivariate Eulerian polynomials and exclusion processes
- scientific article; zbMATH DE number 7644296 (Why is no real title available?)
- A unified approach to multivariate polynomial sequences with real stability
- Stirling permutation codes
- Context-free Grammars and Multivariate Stable Polynomials over Stirling Permutations
- Eulerian-type polynomials over Stirling permutations and box sorting algorithm
- Stirling permutation codes. II
- Stable multivariate Narayana polynomials and labeled plane trees
- New refinements of Narayana polynomials and Motzkin polynomials
- Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers
This page was built for publication: Context-Free Grammars and Stable Multivariate Polynomials over Stirling Permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387104)