Colin Defant

activity

20142026

most citedStack-Sorting Preimages of Permutation Classes

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

collaborators

Showing 2023Show all

7 papers · 1 filter

math.CO2023

Pop-Stack Operators for Torsion Classes and Cambrian Lattices

Emily Barnard, Colin Defant, Eric J. Hanson

The pop-stack operator of a finite lattice $L$ is the map $pop_{L}^{↓} : L \to L$ that sends each element $x \in L$ to the meet of ${x} \cup cov_{L} (x)$ , whe…

math.CO2023

Ordering Candidates via Vantage Points

Noga Alon, Colin Defant, Noah Kravitz +1

Given an $n$ -element set $C \subseteq R^{d}$ and a (sufficiently generic) $k$ -element multiset $V \subseteq R^{d}$ , we can order the points in $C$ by ranking each point $…

math.CO2023

Permutoric Promotion: Gliding Globs, Sliding Stones, and Colliding Coins

Colin Defant, Rachana Madhukara, Hugh Thomas

The first author recently introduced toric promotion, an operator that acts on the labelings of a graph $G$ and serves as a cyclic analogue of Schützenberger's promotion operator.…

math.CO2023

Torsors and tilings from toric toggling

Colin Defant, Michael Joseph, Matthew Macauley +1

Much of dynamical algebraic combinatorics focuses on global dynamical systems defined via maps that are compositions of local toggle operators. The second author and Roby studied s…

math.CO2023

Wiener Indices of Minuscule Lattices

Colin Defant, Valentin Féray, Philippe Nadeau +1

The Wiener index of a finite graph G is the sum over all pairs (p, q) of vertices of G of the distance between p and q. When P is a finite poset, we define its Wiener index as the…

math.CO2023

The Ungar Games

Colin Defant, Noah Kravitz, Nathan Williams

Let $L$ be a finite lattice. An Ungar move sends an element $x \in L$ to the meet of ${x} \cup T$ , where $T$ is a subset of the set of elements covered by $x$ . We introduce the fol…