The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!
type: Item
instance of: scholarly article
title: The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!
zbMATH Open document ID: 0879.05006
author: Miklós Bóna
published in: Advances in Applied Mathematics
publication date: 1997-10-26T00:00:00Z
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 1016989
zbMATH Keywords: permutations
zbMATH Keywords: generating function
MaRDI profile type: Publication
full work available at URL: aama.1997.0528
OpenAlex ID: W2468454950
cites work: Permutations with one or two 132-subsequences
cites work: Permutations avoiding certain patterns: The case of length 4 and some generalizations
cites work: Pattern matching for permutations
cites work: Symmetric functions and P-recursiveness
cites work: The number of permutations containing exactly one increasing subsequence of length three
cites work: Restricted permutations
cites work: Differentiably finite power series
cites work: The enumeration of permutations with a prescribed number of ``forbidden'' patterns
cites work: A holonomic systems approach to special functions identities
DOI: 10.1006/AAMA.1997.0528
description: scientific article; zbMATH DE number 1016989