The following pages link to Vincent R. Vatter (Q696812):
Displaying 11 items.
- Growth rates of permutation classes: from countable to uncountable (Q4973647) (← links)
- Bijective Proofs of Proper Coloring Theorems (Q4991610) (← links)
- Letter Graphs and Geometric Grid Classes of Permutations (Q5048304) (← links)
- Labelled well-quasi-order for permutation classes (Q5051473) (← links)
- Containing All Permutations (Q5144492) (← links)
- On the dimension of downsets of integer partitions and compositions (Q5197587) (← links)
- A Probabilistic Proof of a Lemma That Is Not Burnside’s (Q5207478) (← links)
- An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations (Q5236939) (← links)
- Enumeration Schemes for Restricted Permutations (Q5448994) (← links)
- On the effective and automatic enumeration of polynomial permutation classes (Q5963395) (← links)
- Proof of Dilks' bijectivity conjecture on Baxter permutations (Q6133639) (← links)
