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

DOI10.1007/s00026-016-0308-yzbMath1342.05007arXiv1411.5052MaRDI 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

zbMATH Keywords

words; pattern avoidance; algebraic generating functions

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05A05: Permutations, words, matrices

Uses Software

• OEIS
• Asyrec
• EKHAD