6 citations · 25 across the 32 of their papers we have counts for
9 papers · 2 filters
Highly Sorted Permutations and Bell Numbers
Colin Defant
Let denote West's stack-sorting map. For all positive integers and all integers , we give a simple characterization of the set ; as a consequence,…
Asymptotics of 3-stack-sortable permutations
Colin Defant, Andrew Elvey Price, Anthony J Guttmann
We derive a simple functional equation with two catalytic variables characterising the generating function of 3-stack-sortable permutations. Using this functional equation, we exte…
Typical and Extremal Aspects of Friends-and-Strangers Graphs
Noga Alon, Colin Defant, Noah Kravitz
Given graphs and with vertex sets and of the same cardinality, the friends-and-strangers graph is the graph whose vertex set consists of al…
Friends and Strangers Walking on Graphs
Colin Defant, Noah Kravitz
Given graphs and with vertex sets and of the same cardinality, we define a graph whose vertex set consists of all bijections $σ:V(X)\to V(Y…
Stack-Sorting with Consecutive-Pattern-Avoiding Stacks
Colin Defant, Kai Zheng
We introduce consecutive-pattern-avoiding stack-sorting maps , which are natural generalizations of West's stack-sorting map and natural analogues of the classical…
Promotion Sorting
Colin Defant, Noah Kravitz
Schützenberger's promotion operator is an extensively-studied bijection that permutes the linear extensions of a finite poset. We introduce a natural extension of this o…