极限与2极限的比较

Pub Date : 2023-10-04 DOI:10.1007/s40062-023-00331-4
Ilia Pirashvili
{"title":"极限与2极限的比较","authors":"Ilia Pirashvili","doi":"10.1007/s40062-023-00331-4","DOIUrl":null,"url":null,"abstract":"<div><p>The 2-colimit (also referred to as a pseudo colimit) is the 2-categorical analogue of the colimit and as such, a very important construction. Calculating it is, however, more involved than calculating the colimit. The aim of this paper is to give a condition under which these two constructions coincide. Tough the setting under which our results are applicable is very specific, it is, in fact, fairly important: As shown in a previous paper, the fundamental groupoid can be calculated using the 2-colimit. The results of this paper corresponds precisely to the situation of calculating the fundamental groupoid from a finite covering. We also optimise our condition in the last section, reducing from exponential complexity to a polynomial one.</p></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comparison of the colimit and the 2-colimit\",\"authors\":\"Ilia Pirashvili\",\"doi\":\"10.1007/s40062-023-00331-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The 2-colimit (also referred to as a pseudo colimit) is the 2-categorical analogue of the colimit and as such, a very important construction. Calculating it is, however, more involved than calculating the colimit. The aim of this paper is to give a condition under which these two constructions coincide. Tough the setting under which our results are applicable is very specific, it is, in fact, fairly important: As shown in a previous paper, the fundamental groupoid can be calculated using the 2-colimit. The results of this paper corresponds precisely to the situation of calculating the fundamental groupoid from a finite covering. We also optimise our condition in the last section, reducing from exponential complexity to a polynomial one.</p></div>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2023-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s40062-023-00331-4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s40062-023-00331-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

2-极限(也称为伪极限)是极限的2类类比,因此是一个非常重要的构造。然而,计算它比计算极限要复杂得多。本文的目的是给出这两个结构重合的条件。虽然我们的结果适用的环境是非常具体的,但它实际上是相当重要的:正如前面的文章所示,基本群可以使用2- collimit来计算。本文的结果与从有限覆盖上计算基群的情况完全一致。我们还在最后一节优化了我们的条件,从指数复杂度降低到多项式复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
分享
查看原文
Comparison of the colimit and the 2-colimit

The 2-colimit (also referred to as a pseudo colimit) is the 2-categorical analogue of the colimit and as such, a very important construction. Calculating it is, however, more involved than calculating the colimit. The aim of this paper is to give a condition under which these two constructions coincide. Tough the setting under which our results are applicable is very specific, it is, in fact, fairly important: As shown in a previous paper, the fundamental groupoid can be calculated using the 2-colimit. The results of this paper corresponds precisely to the situation of calculating the fundamental groupoid from a finite covering. We also optimise our condition in the last section, reducing from exponential complexity to a polynomial one.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信