{"title":"有限字符串的范畴","authors":"H. Krause","doi":"10.5802/alco.274","DOIUrl":null,"url":null,"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.","PeriodicalId":36046,"journal":{"name":"Algebraic Combinatorics","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The category of finite strings\",\"authors\":\"H. Krause\",\"doi\":\"10.5802/alco.274\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":36046,\"journal\":{\"name\":\"Algebraic Combinatorics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Algebraic Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5802/alco.274\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebraic Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5802/alco.274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
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.