The following pages link to Restricted permutations (Q5916426):
Displaying 50 items.
- Inversion formulae on permutations avoiding 321 (Q895062) (← links)
- Symmetric functions and P-recursiveness (Q916659) (← links)
- Sign balance for finite groups of Lie type (Q927766) (← links)
- Avoidance of partitions of a three-element set (Q928779) (← links)
- Wilf classification of three and four letter signed patterns (Q932580) (← links)
- The area above the Dyck path of a permutation (Q972852) (← links)
- Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents (Q974742) (← links)
- The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2 (Q976157) (← links)
- More restrictive Gray codes for some classes of pattern avoiding permutations (Q989488) (← links)
- Restricted 123-avoiding Baxter permutations and the Padovan numbers (Q997068) (← links)
- Restricted \(k\)-ary words and functional equations (Q1028452) (← links)
- Symmetric Schröder paths and restricted involutions (Q1043580) (← links)
- The maximal-inversion statistic and pattern-avoiding permutations (Q1043608) (← links)
- The Euler-Catalan identity (Q1110512) (← links)
- Partially ordered sets associated with permutations (Q1122600) (← links)
- Permutation statistics and linear extensions of posets (Q1177948) (← links)
- Vexillary elements in the hyperoctahedral group (Q1272894) (← links)
- The solution of a conjecture of Stanley and Wilf for all layered patterns (Q1279660) (← links)
- Forbidden subsequences and Chebyshev polynomials (Q1300970) (← links)
- Some combinatorial properties of Schubert polynomials (Q1310598) (← links)
- Combinatorial statistics on non-crossing partitions (Q1328401) (← links)
- Forbidden subsequences (Q1336669) (← 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 avoiding certain patterns: The case of length 4 and some generalizations (Q1377745) (← links)
- Permutations with one or two 132-subsequences (Q1381862) (← links)
- Permutations generated by token passing in graphs (Q1391529) (← links)
- Finite transition matrices for permutations avoiding pairs of length four patterns (Q1398262) (← links)
- Consecutive patterns in permutations (Q1398289) (← links)
- On the diagram of 132-avoiding permutations (Q1405003) (← links)
- Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three (Q1408270) (← links)
- A combinatorial proof of J. West's conjecture (Q1584296) (← links)
- Shape avoiding permutations (Q1604576) (← links)
- A new class of Wilf-equivalent permutations (Q1604771) (← links)
- Continued fractions and generalized patterns (Q1612761) (← links)
- On (shape-)Wilf-equivalence for words (Q1661483) (← links)
- Equidistributions of Mahonian statistics over pattern avoiding permutations (Q1691101) (← links)
- On the likelihood of single-peaked preferences (Q1704048) (← links)
- Monomial ideals induced by permutations avoiding patterns (Q1713078) (← links)
- Rooted forests that avoid sets of permutations (Q1715620) (← links)
- Renewal theory for asymmetric \(U\)-statistics (Q1722026) (← links)
- Algorithmic and algebraic aspects of unshuffling permutations (Q1749534) (← links)
- Discrete Morse theory and the consecutive pattern poset (Q1762445) (← links)
- Signed Mahonians (Q1763871) (← links)
- Finite automata and pattern avoidance in words (Q1775550) (← links)
- Finite automata for languages of combinatorial interest: An order theoretical point of view (Q1823003) (← links)
- Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations (Q1865264) (← links)
- On the least exponential growth admitting uncountably many closed permutation classes (Q1885903) (← links)
- Restricted permutations and queue jumping (Q1886351) (← links)
- Generating trees and the Catalan and Schröder numbers (Q1903733) (← links)
