Combinatorial examples and applications of 2-Segal sets
Julia E. Bergner
TL;DR
This paper introduces 2-Segal sets, explores their combinatorial examples, and demonstrates their applications in Hall algebras and a discrete Waldhausen $S_ullet$-construction.
Contribution
It provides an accessible introduction to 2-Segal sets and illustrates their applications in algebraic and combinatorial contexts.
Findings
Several combinatorial examples of 2-Segal sets
Application of 2-Segal sets to Hall algebras
Application to a discrete Waldhausen $S_ullet$-construction
Abstract
We give an introduction to the theory of 2-Segal sets, and two of the main applications of them: Hall algebras and a discrete version of Waldhausen's -construction. We present several combinatorial examples and how these constructions can be applied to them.
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
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems