Insertion algorithms and pattern avoidance on trees arising in the Kapranov embedding of ${\overline{M}}_{0,n+3}$

Abstract

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 ${\overline{M}}_{0,n+3}$ of stable genus zero curves with $n+3$ marked points. Each set of trees enumerates the same intersection product of certain pullbacks of $\ddot{I}ˆ$ classes under forgetting maps. We give an explicit combinatorial bijection between these two sets of trees using an insertion algorithm. We also classify the words that appear on the slide trees of caterpillar shape via pattern avoidance conditions.