2-Segal sets from cuts of rooted trees
Julia E. Bergner, Olivia Borghi, Pinka Dey, Imma Gálvez-Carrillo, Teresa Hoekstra-Mendoza
TL;DR
The paper constructs a concrete family of $2$-Segal sets $X^T$ from rooted trees $T$ using admissible cuts and layerings, and situates these within the broader $2$-Segal, Hall algebra, and operadic framework. It shows how $X^T$ yields a pointed stable double category $\\mathcal{P}X^T$ and analyzes the associated Hall algebra $\mathcal{H}^T$, including noncommutativity in the labelled case and commutativity in certain unlabelled path cases, while comparing to the underlying graph 2-Segal set via a simplicial map $U:X^T\to X^G$ that is not generally CULF or relatively Segal. The work further connects tree-based $2$-Segal structures to invertible operads/cooperads, giving explicit descriptions of $\mathcal{Q}_{X^T}$ and contrasting them with $\mathcal{Q}_{X^G}$, thereby enriching the interaction between combinatorial tree decompositions and operadic formalisms. Overall, the results place rooted-tree constructions squarely in the $2$-Segal/Hall algebra/operad landscape, providing computable, lattice-like examples with clear algebraic consequences.
Abstract
The theory of 2-Segal sets has connections to various important constructions such as the Waldhausen $S_\bullet$-construction in algebraic $K$-theory, Hall algebras, and (co)operads. In this paper, we construct 2-Segal sets from rooted trees and explore how these applications are illustrated by this example.
