The enumeration of permutations with a prescribed number of ``forbidden patterns

DOI10.1006/aama.1996.0016zbMath0974.05001arXivmath/9808080OpenAlexW2094024750MaRDI QIDQ675878

Doron Zeilberger, John Noonan

Publication date: 6 May 1997

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

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

zbMATH Keywords

patternsenumerating sequenceenumeration of permutations

Mathematics Subject Classification ID

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

Related Items (29)

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! ⋮ A generating tree approach to \(k\)-nonnesting partitions and permutations ⋮ Subregularity in infinitely labeled generating trees of restricted permutations ⋮ Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps ⋮ Permutations with one or two 132-subsequences ⋮ Some new binomial sums related to the Catalan triangle ⋮ 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 ⋮ Generating permutations with restricted containers ⋮ Clusters, generating functions and asymptotics for consecutive patterns in permutations ⋮ Pattern frequency sequences and internal zeros ⋮ Counting occurrences of 132 in a permutation ⋮ Counting permutations by their rigid patterns ⋮ Restricted permutations ⋮ Counting occurrences of 231 in an involution ⋮ Recurrence relations for patterns of type (2,1) in flattened permutations ⋮ Permutations restricted by two distinct patterns of length three ⋮ Restricted \(k\)-ary words and functional equations ⋮ The Anisotropic Generating Function of Self-Avoiding Polygons is not D-Finite ⋮ The operators \(F_i\) on permutations, 132-avoiding permutations and inversions ⋮ Recurrence relations in counting the pattern 13-2 in flattened permutations ⋮ Inflations of geometric grid classes of permutations ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations ⋮ Pattern-functions, statistics, and shallow permutations

Uses Software

• gfun

This page was built for publication: The enumeration of permutations with a prescribed number of ``forbidden patterns