The following pages link to Vincent R. Vatter (Q696812):
Displaying 50 items.
- (Q247230) (redirect page) (← links)
- On convex permutations (Q533781) (← links)
- On partial well-order for monotone grid classes of permutations (Q634743) (← links)
- Counting \(\mathbf {(3+1)}\)-avoiding permutations (Q649006) (← links)
- On points drawn from a circle (Q665741) (← links)
- Pattern frequency sequences and internal zeros (Q696813) (← links)
- Bounding quantities related to the packing density of \(1(\ell+1)\ell\cdots 2\) (Q705254) (← links)
- Small configurations in simple permutations (Q709247) (← links)
- Finding regular insertion encodings for permutation classes (Q765858) (← links)
- A sharp bound for the reconstruction of partitions (Q1010680) (← links)
- Profile classes and partial well-order for permutations (Q1422040) (← links)
- Universal layered permutations (Q1658771) (← links)
- Generating permutations with restricted containers (Q1747767) (← links)
- A counterexample regarding labelled well-quasi-ordering (Q1756107) (← links)
- Permutations avoiding two patterns of length three (Q1856068) (← links)
- Generating and enumerating 321-avoiding and skew-merged simple permutations (Q1953536) (← links)
- On the growth of merges and staircases of permutation classes (Q2002496) (← links)
- Independence of permutation limits at infinitely many scales (Q2062759) (← links)
- Letter graphs and modular decomposition (Q2065788) (← links)
- Pattern-restricted permutations composed of 3-cycles (Q2138988) (← links)
- Growth rates of permutation classes: categorization up to the uncountability threshold (Q2182018) (← links)
- Inflations of geometric grid classes of permutations (Q2339726) (← links)
- Well-quasi-order for permutation graphs omitting a path and a clique (Q2344822) (← links)
- A simple proof of a theorem of Schmerl and Trotter for permutations (Q2345765) (← links)
- Decomposing simple permutations, with enumerative consequences (Q2377669) (← links)
- Counting 1324, 4231-avoiding permutations (Q2380302) (← links)
- Rationality for subclasses of 321-avoiding permutations (Q2422212) (← links)
- Simple permutations and algebraic generating functions (Q2426423) (← links)
- Finitely labeled generating trees and restricted permutations (Q2457348) (← links)
- Simple permutations: Decidability and unavoidable substructures (Q2474234) (← links)
- Reconstructing compositions (Q2477377) (← links)
- Grid classes and the Fibonacci dichotomy for restricted permutations (Q2500973) (← links)
- The Möbius function of a composition poset (Q2504997) (← links)
- \(k\)-pop stack sortable permutations and \(2\)-avoidance (Q2662333) (← links)
- Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration (Q2800768) (← links)
- An Erd\H{o}s--Hajnal analogue for permutation classes (Q2831890) (← links)
- Geometric grid classes of permutations (Q2849033) (← links)
- Inflations of Geometric Grid Classes: Three Case Studies (Q2875479) (← links)
- Large infinite antichains of permutations (Q2937640) (← links)
- Permutation classes (Q2949156) (← links)
- Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187) (← links)
- Maximal Independent Sets and Separating Covers (Q3002530) (← links)
- SIMPLE EXTENSIONS OF COMBINATORIAL STRUCTURES (Q3087001) (← links)
- Subclasses of the separable permutations (Q3094058) (← links)
- Small permutation classes (Q3102708) (← links)
- PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188 (Q3406665) (← links)
- Maximal independent sets in graphs with at mostr cycles (Q3418194) (← links)
- Maximal and maximum independent sets in graphs with at mostr cycles (Q3418195) (← links)
- The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations (Q4557004) (← links)
- On the Rearrangement Conjecture for Generalized Factor Order Over $\mathbb{P}$ (Q4584102) (← links)
