Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations

DOI10.1016/S0196-8858(02)00012-XzbMath1013.05006arXivmath/0110036MaRDI QIDQ1865264

Anders Claesson, Toufik Mansour

Publication date: 26 March 2003

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

permutationpattern

Mathematics Subject Classification ID

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

Related Items (13)

Some multivariate master polynomials for permutations, set partitions, and perfect matchings, and their continued fractions ⋮ Decomposing simple permutations, with enumerative consequences ⋮ Crossings and alignments of permutations ⋮ Refining enumeration schemes to count according to permutation statistics ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Equidistributions of Mahonian statistics over pattern avoiding permutations ⋮ Applying the cluster method to count occurrences of generalized permutation patterns ⋮ The Matrix Ansatz, orthogonal polynomials, and permutations ⋮ Rook placements in Young diagrams and permutation enumeration ⋮ Recurrence relations for patterns of type (2,1) in flattened permutations ⋮ Bijections for permutation tableaux ⋮ New permutation statistics: Variation and a variant ⋮ Permutations, Moments, Measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• New Euler-Mahonian statistics on permutations and words
• Counting occurrences of 132 in a permutation
• Forbidden subsequences and Chebyshev polynomials
• Forbidden subsequences
• The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• Permutations with one or two 132-subsequences
• Generalized permutation patterns and a classification of the Mahonian statistics
• Generating trees and the Catalan and Schröder numbers
• The number of permutations containing exactly one increasing subsequence of length three
• Classification of forbidden subsequences of length 4
• On the number of permutations avoiding a given pattern
• Restricted permutations
• Restricted permutations
• Generalized pattern avoidance

This page was built for publication: Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations