2-Segal sets from cuts of rooted trees
Julia E. Bergner, Olivia Borghi, Pinka Dey, Imma G\'alvez-Carrillo,, and Teresa Hoekstra-Mendoza

TL;DR
This paper constructs 2-Segal sets from rooted trees, illustrating their connections to algebraic K-theory, Hall algebras, and operads, and explores their applications in these areas.
Contribution
It introduces a novel method of deriving 2-Segal sets from rooted trees, expanding their applicability in algebraic and combinatorial contexts.
Findings
Constructed 2-Segal sets from rooted trees
Demonstrated applications to algebraic K-theory and Hall algebras
Provided insights into operad-related structures
Abstract
The theory of 2-Segal sets has connections to various important constructions such as the Waldhausen -construction in algebraic -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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation
