The category of finite strings
Representation Theory
2021-09-14 v1 Combinatorics
Category Theory
Abstract
We introduce the category of finite strings and study its basic properties. The category is closely related to the augmented simplex category, and it models categories of linear representations. Each lattice of non-crossing partitions arises naturally as a lattice of subobjects.
Keywords
Cite
@article{arxiv.2109.05745,
title = {The category of finite strings},
author = {Henning Krause},
journal= {arXiv preprint arXiv:2109.05745},
year = {2021}
}
Comments
16 pages