The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic
From MaRDI portal
Publication:295298
DOI10.1007/s00026-016-0308-yzbMath1342.05007arXiv1411.5052OpenAlexW2327859490MaRDI QIDQ295298
Doron Zeilberger, Nathaniel Shar
Publication date: 13 June 2016
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.5052
Related Items
Uses Software
Cites Work
- Unnamed Item
- Pattern avoidance in ordered set partitions
- Patterns in permutations and words.
- Differentiably finite power series
- A holonomic systems approach to special functions identities
- Pattern avoidance in ordered set partitions and words
- Ordered partitions avoiding a permutation pattern of length 3
- Calcul pratique des coefficients de Taylor d'une fonction algébrique
- Combinatorics of Compositions and Words
- Permutations of a multiset avoiding permutations of length 3