Pages that link to "Item:Q675878"

The following pages link to The enumeration of permutations with a prescribed number of ``forbidden'' patterns (Q675878):

Displaying 29 items.

• A generating tree approach to \(k\)-nonnesting partitions and permutations (Q331488) (← links)
• Some new binomial sums related to the Catalan triangle (Q405119) (← links)
• Pattern frequency sequences and internal zeros (Q696813) (← links)
• Counting occurrences of 132 in a permutation (Q696855) (← links)
• Counting permutations by their rigid patterns (Q696917) (← links)
• Restricted \(k\)-ary words and functional equations (Q1028452) (← links)
• The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size! (Q1356119) (← links)
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps (Q1374188) (← links)
• Permutations with one or two 132-subsequences (Q1381862) (← links)
• Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three (Q1408270) (← links)
• Continued fractions and generalized patterns (Q1612761) (← links)
• Generating permutations with restricted containers (Q1747767) (← links)
• Clusters, generating functions and asymptotics for consecutive patterns in permutations (Q1761477) (← links)
• Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations (Q1865264) (← links)
• Pattern-functions, statistics, and shallow permutations (Q2112582) (← links)
• Subregularity in infinitely labeled generating trees of restricted permutations (Q2155932) (← links)
• The operators \(F_i\) on permutations, 132-avoiding permutations and inversions (Q2319725) (← links)
• Inflations of geometric grid classes of permutations (Q2339726) (← links)
• Decomposing simple permutations, with enumerative consequences (Q2377669) (← links)
• Counting occurrences of 231 in an involution (Q2488929) (← links)
• The Anisotropic Generating Function of Self-Avoiding Polygons is not D-Finite (Q3651682) (← links)
• Enumeration of Dumont permutations avoiding certain four-letter patterns (Q5074772) (← links)
• (Q5197595) (← links)
• Recurrence relations in counting the pattern 13-2 in flattened permutations (Q5248187) (← links)
• Recurrence relations for patterns of type (2,1) in flattened permutations (Q5746468) (← links)
• Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
• Restricted permutations (Q5906401) (← links)
• Permutations restricted by two distinct patterns of length three (Q5956781) (← links)
• Subsequence frequency in binary words (Q6204345) (← links)