The following pages link to Patterns in permutations and words. (Q632372):
Displaying 50 items.
- Staircase patterns in words: subsequences, subwords, and separation number (Q1987094) (← links)
- The pure descent statistic on permutations (Q2012552) (← links)
- Reduced word manipulation: patterns and enumeration (Q2014259) (← links)
- Equidistributions of mesh patterns of length two and Kitaev and Zhang's conjectures (Q2020045) (← links)
- Permutation groups arising from pattern involvement (Q2021398) (← links)
- Constructing separable Arnold snakes of Morse polynomials (Q2025699) (← links)
- Catalan and Schröder permutations sortable by two restricted stacks (Q2032179) (← links)
- Pattern statistics in faro words and permutations (Q2032888) (← links)
- Stack-sorting with consecutive-pattern-avoiding stacks (Q2035992) (← links)
- Lower bounds for superpatterns and universal sequences (Q2037175) (← links)
- The \(r\)-Stirling numbers of the first kind in terms of the Möbius function (Q2038997) (← links)
- Sorting probability of Catalan posets (Q2040996) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Permutations avoiding certain partially-ordered patterns (Q2048546) (← links)
- Permutation reconstruction from a few large patterns (Q2049616) (← links)
- Refined Wilf-equivalences by Comtet statistics (Q2055135) (← links)
- Pattern occurrences in \(k\)-ary words revisited: a few new and old observations (Q2077272) (← links)
- Almost square permutations are typically square (Q2077345) (← links)
- Pattern-avoiding ascent sequences of length 3 (Q2094900) (← links)
- Structured preferences: a literature survey (Q2096158) (← links)
- Pattern-functions, statistics, and shallow permutations (Q2112582) (← links)
- Asymptotic behaviour of the containment of certain mesh patterns (Q2113370) (← links)
- Fast and longest rollercoasters (Q2118392) (← links)
- Troupes, cumulants, and stack-sorting (Q2118918) (← links)
- A combinatorial bijection on di-sk trees (Q2121740) (← links)
- Pattern avoidance of \([4,k]\)-pairs in circular permutations (Q2134002) (← links)
- A decomposition of ballot permutations, pattern avoidance and Gessel walks (Q2154328) (← links)
- Subregularity in infinitely labeled generating trees of restricted permutations (Q2155932) (← links)
- Patterns in Shi tableaux and Dyck paths (Q2160023) (← links)
- Sorting by shuffling methods and a queue (Q2161211) (← links)
- Supertrees (Q2181994) (← links)
- Floodings of metric graphs (Q2182128) (← links)
- Polyurethane toggles (Q2188837) (← links)
- A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate (Q2189832) (← links)
- Pattern-avoiding permutation powers (Q2198373) (← links)
- Stack-sorting preimages of permutation classes (Q2199801) (← links)
- Pattern-avoiding inversion sequences and open partition diagrams (Q2202026) (← links)
- Stieltjes moment sequences for pattern-avoiding permutations (Q2209890) (← links)
- The range of repetition in reduced decompositions (Q2221777) (← links)
- A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples (Q2221912) (← links)
- Fertility monotonicity and average complexity of the stack-sorting map (Q2225458) (← links)
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences (Q2225465) (← links)
- Pattern avoidance in biwords (Q2237219) (← links)
- Block decomposition and statistics arising from permutation tableaux (Q2237853) (← links)
- On \(1324\)-avoiding permutations (Q2254999) (← links)
- On a refinement of Wilf-equivalence for permutations (Q2256116) (← links)
- Ascent sequences avoiding pairs of patterns (Q2260633) (← links)
- Exhaustive generation for permutations avoiding (colored) regular sets of patterns (Q2274076) (← links)
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions (Q2279227) (← links)
- Patterns of relation triples in inversion and ascent sequences (Q2283035) (← links)
