Words restricted by 3-letter generalized multipermutation patterns

DOI10.1007/S000260300000zbMath1017.05001arXivmath/0112281OpenAlexW1978262004MaRDI 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

zbMATH Keywords

generating functionsgeneralized patterns\(k\)-ary words

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (7)

Permutations and words counted by consecutive patterns ⋮ Counting words with Laguerre series ⋮ Consecutive patterns in Catalan words and the descent distribution ⋮ Some results on the avoidance of vincular patterns by multisets ⋮ A new class of multiset Wilf equivalent pairs ⋮ Restricted \(k\)-ary words and functional equations ⋮ Segmental partially ordered generalized patterns

This page was built for publication: Words restricted by 3-letter generalized multipermutation patterns