We resolve a question of Gillespie, Griffin, and Levinson that asks for a combinatorial bijection between two classes of trivalent trees, tournament trees and slide trees, that both naturally arise in the intersection theory of the moduli space of stable genus zero curves with n marked points. In this talk, we give an explicit combinatorial bijection between these two sets of trees using an insertion algorithm, and also classify the words that appear on the slide trees of caterpillar shape via pattern avoidance conditions.
Insertion algorithms and pattern avoidance on trees coming from the moduli space of curves Sponsored by the Meyer Fund
Tue, Oct. 21 2:30pm (MATH 2…
Grad Algebra/Logic
Nick Jamesson (CU) Categorical Perspective on Constraint Satisfaction (Part 5)
Insertion algorithms and pattern avoidance on trees coming from the moduli space of curves