Exceptional sequences and rooted labeled forests
Kiyoshi Igusa, Emre Sen
TL;DR
This work provides a representation-theoretic combinatorial framework for complete exceptional sequences of type $A_n$ by establishing a bijection with rooted labeled forests. Through this lens, relatively projective and relatively injective objects are read directly from the forest topology, and a three-variable generating function counts sequences by these types. The authors equip rooted labeled forests with a natural braid-group action that mirrors the action on exceptional sequences, and they analyze the Garside element $\Delta$ to illuminate connections with cluster theory and signed exceptional sequences. They also relate parking-function constructions and chord diagrams to their forest model, yielding a versatile visualization and counting toolkit with potential extensions to cluster-tilting theory and related algebras.
Abstract
We give a representation-theoretic bijection between rooted labeled forests with $n$ vertices and complete exceptional sequences for the quiver of type $A_n$ with straight orientation. The ascending and descending vertices in the forest correspond to relatively injective and relatively projective objects in the exceptional sequence. We conclude that every object in an exceptional sequence for linearly oriented $A_n$ is either relatively projective or relatively injective or both. We construct a natural action of the extended braid group on rooted labeled forests and show that it agrees with the known action of the braid group on complete exceptional sequences. We also describe the action of $Δ$, the Garside element of the braid group, on rooted labeled forests using representation theory and show how this relates to cluster theory.
