The following pages link to Patterns in permutations and words. (Q632372):
Displayed 50 items.
- Vincular patterns in inversion sequences (Q2284074) (← links)
- Distributions of several infinite families of mesh patterns (Q2287809) (← links)
- Stack sorting with increasing and decreasing stacks (Q2288161) (← links)
- On pattern-avoiding Fishburn permutations (Q2299131) (← links)
- Popularity of patterns over \(d\)-equivalence classes of words and permutations (Q2304570) (← links)
- On partially ordered patterns of length 4 and 5 in permutations (Q2318773) (← links)
- The operators \(F_i\) on permutations, 132-avoiding permutations and inversions (Q2319725) (← links)
- Passing through a stack \(k\) times with reversals (Q2323106) (← links)
- Occurrence graphs of patterns in permutations (Q2326840) (← links)
- Distributions of mesh patterns of short lengths (Q2326900) (← links)
- From \(q\)-Stirling numbers to the ordered multiset partitions: a viewpoint from vincular patterns (Q2326906) (← links)
- Hook formulas for skew shapes. III: Multivariate and product formulas (Q2328136) (← links)
- Mahonian STAT on rearrangement class of words (Q2334048) (← links)
- Frame patterns in \(n\)-cycles (Q2339437) (← links)
- \((a, b)\)-rectangle patterns in permutations and words (Q2345605) (← links)
- On the topology of the permutation pattern poset (Q2347966) (← links)
- Counting subwords in flattened partitions of sets (Q2352065) (← links)
- Eulerian polynomials and descent statistics (Q2363310) (← links)
- Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\) (Q2363386) (← links)
- 2-stack sorting is polynomial (Q2363966) (← links)
- Prolific permutations and permuted packings: downsets containing many large patterns (Q2403721) (← links)
- Extremal functions of forbidden multidimensional matrices (Q2404366) (← links)
- Pattern avoidance in ordered set partitions and words (Q2406542) (← links)
- Longest monotone subsequences and rare regions of pattern-avoiding permutations (Q2409846) (← links)
- \((q, t)\)-Catalan numbers: gamma expansions, pattern avoidances, and the \((-1)\)-phenomenon (Q2417196) (← links)
- The Eulerian distribution on involutions is indeed \(\gamma\)-positive (Q2424907) (← links)
- Restricted non-separable planar maps and some pattern avoiding permutations (Q2444543) (← links)
- Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations (Q2657073) (← links)
- Square permutations are typically rectangular (Q2657936) (← links)
- Ferromagnetism in \(d\)-dimensional \(\mathrm{SU}(n)\) Hubbard models with nearly flat bands (Q2658091) (← links)
- The \(\gamma \)-positive coefficients arising in segmented permutations (Q2659248) (← links)
- Wilf equivalences between vincular patterns in inversion sequences (Q2660332) (← links)
- \(k\)-pop stack sortable permutations and \(2\)-avoidance (Q2662333) (← links)
- Patterns in random permutations (Q2663415) (← links)
- The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three (Q2666581) (← links)
- Permutations encoding the local shape of level curves of real polynomials via generic projections (Q2675335) (← links)
- Equidistributions of mesh patterns of length two (Q2680885) (← links)
- On five types of crucial permutations with respect to monotone patterns (Q2692179) (← links)
- Absent subsequences in words (Q2695493) (← links)
- Tests and Proofs for Enumerative Combinatorics (Q2827441) (← links)
- Representing Permutations with Few Moves (Q2827490) (← links)
- Structure of random 312-avoiding permutations (Q2830242) (← links)
- UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS (Q2874053) (← links)
- Counting subwords in flattened involutions and Kummer functions (Q2964219) (← links)
- Stack-sorting for Words (Q3300688) (← links)
- Inversion sequences avoiding pairs of patterns (Q3386620) (← links)
- Counting pattern avoiding permutations by number of movable letters (Q3390785) (← links)
- Word-Representable Graphs: a Survey (Q4558287) (← links)
- Zig-zag facial total-coloring of plane graphs (Q4561211) (← links)
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations (Q4600719) (← links)