3 citations · 14 across the 13 of their papers we have counts for
25 papers · 1 filter
Monotone links in DAHA and EHA
Pavel Galashin, Thomas Lam
We define monotone links on a torus, obtained as projections of curves in the plane whose coordinates are monotone increasing. Using the work of Morton-Samuelson, to each monotone…
Move-reduced graphs on a torus
Pavel Galashin, Terrence George
We determine which bipartite graphs embedded in a torus are move-reduced. In addition, we classify equivalence classes of such move-reduced graphs under square/spider moves. This e…
Braid variety cluster structures, I: 3D plabic graphs
Pavel Galashin, Thomas Lam, Melissa Sherman-Bennett +1
We introduce -dimensional generalizations of Postnikov's plabic graphs and use them to establish cluster structures for type braid varieties. Our results include known clust…
Plabic links, quivers, and skein relations
Pavel Galashin, Thomas Lam
We study relations between cluster algebra invariants and link invariants. First, we show that several constructions of positroid links (permutation links, Richardson links, grid d…
Rational Noncrossing Coxeter-Catalan Combinatorics
Pavel Galashin, Thomas Lam, Minh-Tâm Quang Trinh +1
We solve two open problems in Coxeter-Catalan combinatorics. First, we introduce a family of rational noncrossing objects for any finite Coxeter group, using the combinatorics of d…
-associahedra
Pavel Galashin
For each poset , we construct a polytope called the -associahedron. Similarly to the case of graph associahedra, the faces of correspond to certain nested colle…