activity
20142026
most citedStack-Sorting Preimages of Permutation Classes

12 citations · 98 across the 59 of their papers we have counts for

collaborators
Showing 2021Show all

9 papers · 1 filter

math.CO2021

Toric Promotion

Colin Defant

We introduce toric promotion as a cyclic analogue of Schützenberger's promotion operator. Toric promotion acts on the set of labelings of a graph . We discuss connections betwee…

math.CO2021

Semidistrim Lattices

Colin Defant, Nathan Williams

We introduce semidistrim lattices, a simultaneous generalization of semidistributive and trim lattices that preserves many of their common properties. We prove that the elements of…

math.CO2021

Crystal Pop-Stack Sorting and Type A Crystal Lattices

Colin Defant, Nathan Williams

Given a complex simple Lie algebra and a dominant weight , let be the crystal poset associated to the irreducible representation of wi…

math.CO2021★ 3 cited

Homomesy via Toggleability Statistics

Colin Defant, Sam Hopkins, Svetlana Poznanović +1

The rowmotion operator acting on the set of order ideals of a finite poset has been the focus of a significant amount of recent research. One of the major goals has been to exhibit…

math.CO2021

The runsort permuton

Noga Alon, Colin Defant, Noah Kravitz

Suppose we choose a permutation uniformly at random from . Let be the permutation obtained by sorting the ascending runs of into lexicographic or…

math.CO2021★ 1 cited

Meeting Covered Elements in -Tamari Lattices

Colin Defant

For each complete meet-semilattice , we define an operator by \[\mathsf{Pop}_M(x)=\bigwedge(\{y\in M:y\lessdot x\}\cup\{x\}).\] When is the right wea…