The number of permutations containing exactly one increasing subsequence of length three
From MaRDI portal
Publication:1917505
DOI10.1016/0012-365X(95)00247-TzbMath0852.05009WikidataQ127343814 ScholiaQ127343814MaRDI QIDQ1917505
Publication date: 25 November 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (24)
Continued fractions and generalized patterns ⋮ Unnamed Item ⋮ 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 ⋮ The phagocyte lattice of Dyck words ⋮ Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps ⋮ Permutations with one or two 132-subsequences ⋮ Enumeration of words that contain the pattern 123 exactly once ⋮ Enumeration schemes for vincular patterns ⋮ Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three ⋮ Subsequence frequency in binary words ⋮ Enumeration of Dumont permutations avoiding certain four-letter patterns ⋮ 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 ⋮ Vexillary elements in the hyperoctahedral group ⋮ Restricted \(k\)-ary words and functional equations ⋮ The operators \(F_i\) on permutations, 132-avoiding permutations and inversions ⋮ Almost avoiding permutations ⋮ Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations ⋮ Pattern-functions, statistics, and shallow permutations
Cites Work
This page was built for publication: The number of permutations containing exactly one increasing subsequence of length three
