Context-free grammars for several polynomials associated with Eulerian polynomials (Q1700800): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1609.05829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear transformations preserving the Pólya frequency property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unimodal Polynomials Arising from Symmetric Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(q\)-Eulerian polynomials arising from Coxeter groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of \(q\)-symmetric functions arising from plethysm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free grammars, differential operators and formal power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derangement polynomials and excedances of type \(B\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free grammars for permutations and increasing trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On derangement polynomials of type \(B\). II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting signed permutations by their alternating runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: William Chen grammars and derivations in trees and arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan grammar and Cayley trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\gamma\)-positivity of basic Eulerian polynomials via group actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial arrays generated by context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of permutations by number of alternating runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(q\)-Eulerian polynomials and polynomials with only real zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stirling permutations, cycle structure of permutations and perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian polynomials, Stirling permutations of the second kind and perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: 𝑞-Eulerian polynomials: Excedance number and major index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest alternating subsequences of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian numbers, tableaux, and the Betti numbers of a toric variety / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:32, 15 July 2024

scientific article
Language Label Description Also known as
English
Context-free grammars for several polynomials associated with Eulerian polynomials
scientific article

    Statements

    Context-free grammars for several polynomials associated with Eulerian polynomials (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 February 2018
    0 references
    Summary: In this paper, we present grammatical descriptions of several polynomials associated with Eulerian polynomials, including \(q\)-Eulerian polynomials, alternating run polynomials and derangement polynomials. As applications, we get several convolution formulas involving these polynomials.
    0 references
    Eulerian polynomials
    0 references
    alternating runs
    0 references
    derangement polynomials
    0 references
    context-free grammars
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references