12 citations · 98 across the 59 of their papers we have counts for
12 papers · 1 filter
Supertrees
Colin Defant, Noah Kravitz, Ashwin Sah
A -universal permutation, or -superpermutation, is a permutation that contains all permutations of length as patterns. The problem of finding the minimum length of a -…
Pattern-Avoiding Permutation Powers
Amanda Burcroff, Colin Defant
Recently, Bóna and Smith defined strong pattern avoidance, saying that a permutation strongly avoids a pattern if and both avoid . They conjectured that for ev…
Proofs of Conjectures about Pattern-Avoiding Linear Extensions
Colin Defant
After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation. Some recent papers consi…
Isoperimetry, Stability, and Irredundance in Direct Products
Noga Alon, Colin Defant
The direct product of graphs is the graph with vertex set in which two vertices and are a…
Motzkin Intervals and Valid Hook Configurations
Colin Defant
We define a new natural partial order on Motzkin paths that serves as an intermediate step between two previously-studied partial orders. We provide a bijection between valid hook…
Polyurethane Toggles
Colin Defant
We consider the involutions known as "toggles," which have been used to give simplified proofs of the fundamental properties of the promotion and evacuation maps. We transfer these…