14 citations · 40 across the 13 of their papers we have counts for
15 papers
Invariance of rowmotion for variants of the Tamari lattice
Ben Adenbaum, Emily Barnard, Cesar Ceballos +6
We show that the rowmotion operator from dynamical algebraic combinatorics behaves the same on all alt -Tamari lattices for a fixed lattice path . We use this invariance of r…
The poset of maximal tubings of the cycle graph is a lattice
Ben Adenbaum, Emily Barnard, Max Hlavacek +4
The poset of maximal tubings of a graph generalizes several well-known and remarkable partial orders. Notable examples include the weak Bruhat order and the Tamari lattice, posets…
Orbitmesy and promotion on self-dual posets
Esther Banaian, Emily Barnard, Sunita Chepuri +1
We introduce the notion of orbitmesy, which is related to homomesy, a central phenomenon in dynamical algebraic combinatorics. An orbit is said to be orbitmesic with respect to…
Noncrossing arc diagrams of type B
Emily Barnard, Nathan Reading, Ashley M. Tharp
Noncrossing arc diagrams are combinatorial models for permutations that encode information about lattice congruences of the weak order and about the associated discrete geometry. I…
Separating trees and simple congruences of the weak order
Emily Barnard, Jean-Christophe Novelli, Vincent Pilaud
A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in te…
Maximal almost rigid modules over gentle algebras
Emily Barnard, Raquel Coelho Simoes, Emily Gunawan +1
We study maximal almost rigid modules over a gentle algebra . We prove that the number of indecomposable direct summands of every maximal almost rigid -module is equal to the…