The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!

DOI10.1006/aama.1997.0528zbMath0879.05006OpenAlexW2468454950MaRDI QIDQ1356119

Miklós Bóna

Publication date: 26 October 1997

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

Full work available at URL: https://doi.org/10.1006/aama.1997.0528

zbMATH Keywords

permutationsgenerating function

Mathematics Subject Classification ID

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

Related Items

Unnamed Item, Decomposing simple permutations, with enumerative consequences, Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps, 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, Small configurations in simple permutations, Vexillary elements in the hyperoctahedral group, 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

• Pattern matching for permutations
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• Symmetric functions and P-recursiveness
• Differentiably finite power series
• A holonomic systems approach to special functions identities
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
• Permutations with one or two 132-subsequences
• The number of permutations containing exactly one increasing subsequence of length three
• Restricted permutations