Permutations with one or two 132-subsequences
From MaRDI portal
Publication:1381862
DOI10.1016/S0012-365X(97)00062-9zbMath0896.05004MaRDI QIDQ1381862
Publication date: 1 April 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05)
Related Items
Decomposing simple permutations, with enumerative consequences ⋮ The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size! ⋮ Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization ⋮ Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps ⋮ On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation ⋮ Enumeration of words that contain the pattern 123 exactly once ⋮ On the diagram of 132-avoiding permutations ⋮ Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three ⋮ Subsequence frequency in binary words ⋮ Pattern frequency sequences and internal zeros ⋮ Counting occurrences of 132 in a permutation ⋮ Restricted permutations ⋮ Counting occurrences of 231 in an involution ⋮ Permutations restricted by two distinct patterns of length three ⋮ The operators \(F_i\) on permutations, 132-avoiding permutations and inversions ⋮ Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations ⋮ Pattern-functions, statistics, and shallow permutations
Cites Work
- Unnamed Item
- Unnamed Item
- The enumeration of permutations with a prescribed number of ``forbidden patterns
- Differentiably finite power series
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
- The number of permutations containing exactly one increasing subsequence of length three
- Pattern matching for permutations
- Restricted permutations
