The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic (Q295298): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1411.5052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations of a multiset avoiding permutations of length 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered partitions avoiding a permutation pattern of length 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calcul pratique des coefficients de Taylor d'une fonction algébrique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern avoidance in ordered set partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of Compositions and Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern avoidance in ordered set partitions and words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patterns in permutations and words. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3084744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differentiably finite power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: A holonomic systems approach to special functions identities / rank
 
Normal rank

Latest revision as of 04:13, 12 July 2024

scientific article
Language Label Description Also known as
English
The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic
scientific article

    Statements

    The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic (English)
    0 references
    0 references
    0 references
    13 June 2016
    0 references
    The authors generalize a result of \textit{W. Y. C. Chen} et al. [Eur. J. Comb. 36, 416--424 (2014; Zbl 1284.05034)]. From the authors' abstract: ``(W)e present an algorithm for finding\dots an algebraic equation for the ordinary generating function enumerating 123-avoiding words with exactly \(r\) occurrences of each of \(\{1,2,\dots,n\}\) for \textit{any} positive integer \(r\), thereby proving that they are \textit{algebraic}.''
    0 references
    0 references
    pattern avoidance
    0 references
    words
    0 references
    algebraic generating functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references