The following pages link to Restricted permutations (Q5916426):
Displaying 50 items.
- Two descent statistics over \(321\)-avoiding centrosymmetric involutions (Q252851) (← links)
- Pattern matching for permutations (Q293263) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- Pattern avoidance in poset permutations (Q304187) (← links)
- Signed enumeration of upper-right corners in path shuffles (Q338583) (← links)
- Permutation pattern avoidance and the Catalan triangle (Q350823) (← links)
- Free rises, restricted partitions, and \(q\)-Fibonacci polynomials (Q384775) (← links)
- Generalized Schröder permutations (Q391425) (← links)
- Partial permutations avoiding pairs of patterns (Q393932) (← links)
- Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths (Q394358) (← links)
- Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux (Q396936) (← links)
- Sign imbalances of snakes and valley-signed permutations (Q404290) (← links)
- Pattern avoidance in ordered set partitions (Q404537) (← links)
- Equivalence classes of permutations modulo replacements between 123 and two-integer patterns (Q405257) (← links)
- Refining enumeration schemes to count according to permutation statistics (Q405263) (← links)
- The weak order on pattern-avoiding permutations (Q405300) (← links)
- Repetition in reduced decompositions (Q432487) (← links)
- Sign-balance identities of Adin-Roichman type on 321-avoiding alternating permutations (Q442305) (← links)
- Permutation patterns and statistics (Q449114) (← links)
- Enumeration formulæ for pattern restricted Stirling permutations (Q456658) (← links)
- Catalan numbers and pattern restricted set partitions (Q456885) (← links)
- Descent sets on 321-avoiding involutions and hook decompositions of partitions (Q458291) (← links)
- Operators of equivalent sorting power and related Wilf-equivalences (Q463051) (← links)
- On the sub-permutations of pattern avoiding permutations (Q465287) (← links)
- An infinite family of inv-Wilf-equivalent permutation pairs (Q472398) (← links)
- A note on statistical averages for oscillating tableaux (Q491542) (← links)
- Restricted partitions and \(q\)-Pell numbers (Q539195) (← links)
- Restricted involutions and Motzkin paths (Q544138) (← links)
- The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns (Q556857) (← links)
- Refined sign-balance on 321-avoiding permutations (Q557611) (← links)
- Bijections for refined restricted permutations (Q598452) (← links)
- Sorting with networks of data structures (Q602673) (← links)
- Consecutive pattern avoidances in non-crossing trees (Q607683) (← links)
- Cyclic and lift closures for \(k \ldots 21\)-avoiding permutations (Q616361) (← links)
- Pattern avoiding partitions and Motzkin left factors (Q657426) (← links)
- Permutations generated by stacks and deques (Q659569) (← links)
- Symmetric permutations avoiding two patterns (Q659572) (← links)
- The enumeration of maximally clustered permutations (Q659577) (← links)
- Enumerating \(r\)c-invariant permutations with no long decreasing subsequences (Q659582) (← links)
- Generating-tree isomorphisms for pattern-avoiding involutions (Q659648) (← links)
- Sorting twice through a stack (Q688711) (← links)
- Pattern frequency sequences and internal zeros (Q696813) (← links)
- Counting permutations by their rigid patterns (Q696917) (← links)
- Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomials (Q705239) (← links)
- Mesh patterns with superfluous mesh (Q744168) (← links)
- Restricted permutations refined by number of crossings and nestings (Q776264) (← links)
- Permuting machines and priority queues (Q817805) (← links)
- Refined restricted involutions (Q854848) (← links)
- Restricted Dumont permutations, Dyck paths, and noncrossing partitions (Q860451) (← links)
- Wilf-classification of mesh patterns of short length (Q888626) (← links)
