Data types with symmetries and polynomial functors over groupoids
Joachim Kock

TL;DR
This paper extends polynomial functor theory from sets to groupoids to better handle data types with symmetries, unifying various frameworks and applying to quantum field theory structures.
Contribution
It introduces a homotopical approach to polynomial functors over groupoids, providing a unified framework for quotient containers, species, and related concepts, with applications to quantum field theory.
Findings
Groupoid-based polynomial functors handle symmetries elegantly.
The theory unifies quotient containers, species, and stuff types.
Applications demonstrated in quantum field theory graph structures.
Abstract
Polynomial functors are useful in the theory of data types, where they are often called containers. They are also useful in algebra, combinatorics, topology, and higher category theory, and in this broader perspective the polynomial aspect is often prominent and justifies the terminology. For example, Tambara's theorem states that the category of finite polynomial functors is the Lawvere theory for commutative semirings. In this talk I will explain how an upgrade of the theory from sets to groupoids is useful to deal with data types with symmetries, and provides a common generalisation of and a clean unifying framework for quotient containers (cf. Abbott et al.), species and analytic functors (Joyal 1985), as well as the stuff types of Baez-Dolan. The multi-variate setting also includes relations and spans, multispans, and stuff operators. An attractive feature of this theory is that…
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.
