Voir la notice de l'article provenant de la source Numdam
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.
Krause, Henning 1
@article{ALCO_2023__6_3_661_0, author = {Krause, Henning}, title = {The category of finite strings}, journal = {Algebraic Combinatorics}, pages = {661--676}, publisher = {The Combinatorics Consortium}, volume = {6}, number = {3}, year = {2023}, doi = {10.5802/alco.274}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.5802/alco.274/} }
Krause, Henning. The category of finite strings. Algebraic Combinatorics, Tome 6 (2023) no. 3, pp. 661-676. doi: 10.5802/alco.274
Cité par Sources :