Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Skew-monoidal categories and the Catalan simplicial set (1307.0265v1)

Published 1 Jul 2013 in math.CT

Abstract: The basic data for a skew-monoidal category are the same as for a monoidal category, except that the constraint morphisms are no longer required to be invertible. The constraints are given a specific orientation and satisfy Mac Lane's five axioms. Whilst recent applications justify the use of skew-monoidal structure, they do not give an intrinsic justification for the form the structure takes (the orientation of the constraints and the axioms that they satisfy). This paper provides a perspective on skew-monoidal structure which, amongst other things, makes it quite apparent why this particular choice is a natural one. To do this, we use the Catalan simplicial set C. It turns out to be quite easy to describe: it is the nerve of the monoidal poset (2, v, 0) and has a Catalan number of simplices at each dimension (hence the name). Our perspective is that C classifies skew-monoidal structures in the sense that simplicial maps from C into a suitably-defined nerve of Cat are precisely skew-monoidal categories. More generally, skew monoidales in a monoidal bicategory K are classified by maps from C into the simplicial nerve of K.

Summary

We haven't generated a summary for this paper yet.