2000 character limit reached
Coherence for braided and symmetric pseudomonoids
Published 25 May 2017 in math.CT, cs.FL, and math.QA | (1705.09354v3)
Abstract: Presentations for unbraided, braided and symmetric pseudomonoids are defined. Biequivalences characterising the semistrict bicategories generated by these presentations are proven. It is shown that these biequivalences categorify results in the theory of monoids and commutative monoids, and generalise standard coherence theorems for braided and symmetric monoidal categories.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.