Words restricted by 3-letter generalized multipermutation patterns
From MaRDI portal
Publication:1400799
DOI10.1007/s000260300000zbMath1017.05001arXivmath/0112281MaRDI QIDQ1400799
Alexander Burstein, Toufik Mansour
Publication date: 14 August 2003
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0112281
05A15: Exact enumeration problems, generating functions
68R15: Combinatorics on words
05A05: Permutations, words, matrices
Related Items
Counting words with Laguerre series, Some results on the avoidance of vincular patterns by multisets, Segmental partially ordered generalized patterns, Permutations and words counted by consecutive patterns, Restricted \(k\)-ary words and functional equations, A new class of multiset Wilf equivalent pairs