Classification of forbidden subsequences of length 4

DOI10.1006/eujc.1996.0044zbMath0857.05007OpenAlexW2047160913MaRDI QIDQ1922878

Zvezdelina E. Stankova

Publication date: 6 March 1997

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1996.0044

zbMATH Keywords

permutationforbidden subsequences

Mathematics Subject Classification ID

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

Related Items (23)

Nine classes of permutations enumerated by binomial transform of Fine's sequence ⋮ Generating trees and the Catalan and Schröder numbers ⋮ Wilf-equivalence for singleton classes ⋮ Restricted Dumont permutations, Dyck paths, and noncrossing partitions ⋮ Unnamed Item ⋮ Wilf classification of three and four letter signed patterns ⋮ Some results on the avoidance of vincular patterns by multisets ⋮ Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind ⋮ Finitely labeled generating trees and restricted permutations ⋮ Counting permutations by their rigid patterns ⋮ Restricted permutations ⋮ Counting occurrences of 231 in an involution ⋮ Decreasing subsequences in permutations and Wilf equivalence for involutions ⋮ Reduced word manipulation: patterns and enumeration ⋮ Permutations of a multiset avoiding permutations of length 3 ⋮ Set-valued Rothe tableaux and Grothendieck polynomials ⋮ Unnamed Item ⋮ Permutation patterns and cell decompositions ⋮ Explicit enumeration of 321, hexagon-avoiding permutations ⋮ Sorting with two ordered stacks in series. ⋮ On the centrosymmetric permutations in a class ⋮ A new class of Wilf-equivalent permutations ⋮ Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations

This page was built for publication: Classification of forbidden subsequences of length 4