Words restricted by patterns with at most 2 distinct letters

zbMath1021.05002arXivmath/0110056MaRDI QIDQ1856065

Alexander Burstein, Toufik Mansour

Publication date: 13 May 2003

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0110056

zbMATH Keywords

generating functionsbijective proofsavoiding certain patterns

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (18)

Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method ⋮ On avoiding 1233 ⋮ A statistic related to trees and words on a finite alphabet ⋮ On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions ⋮ Permutations and words counted by consecutive patterns ⋮ Enumeration formulæ for pattern restricted Stirling permutations ⋮ Some results on the avoidance of vincular patterns by multisets ⋮ A new class of multiset Wilf equivalent pairs ⋮ Longest alternating subsequences of \(k\)-ary words ⋮ Avoiding patterns of length three in compositions and multiset permutations ⋮ Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions ⋮ Finite automata and pattern avoidance in words ⋮ Unnamed Item ⋮ On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions ⋮ Increasing consecutive patterns in words ⋮ Restricted \(k\)-ary words and functional equations ⋮ Stack-sorting for Words ⋮ Segmental partially ordered generalized patterns

This page was built for publication: Words restricted by patterns with at most 2 distinct letters