Multi-avoidance of generalised patterns

DOI10.1016/S0012-365X(02)00452-1zbMath1013.05005OpenAlexW1971928632MaRDI QIDQ1861246

Sergey Kitaev

Publication date: 16 March 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00452-1

zbMATH Keywords

permutationspatternspattern-avoidancegeneralised patternsgeneralised permutation patterns

Mathematics Subject Classification ID

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

Related Items (max. 100)

Introduction to partially ordered patterns ⋮ Counting permutations modulo pattern-replacement equivalences for three-letter patterns ⋮ Consecutive patterns in permutations ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Enumeration schemes for vincular patterns ⋮ On uniquely \(k\)-determined permutations ⋮ Asymptotic enumeration of permutations avoiding generalized patterns ⋮ Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials ⋮ Avoiding consecutive patterns in permutations ⋮ Cyclic pattern containment and avoidance ⋮ Partially ordered generalized patterns ⋮ Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials ⋮ Inversion polynomials for permutations avoiding consecutive patterns ⋮ Segmental partially ordered generalized patterns

This page was built for publication: Multi-avoidance of generalised patterns