arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.06231math.CTmath.AT
收藏

用于算盘结构的图的范畴

Categories of graphs for operadic structures

Philip Hackney

AI总结:

本文回顾了用于描述广义算盘同伦相干版本的图的范畴,给出态射的新统一定义,并证明了广义算盘范畴间的自由-遗忘伴随关系可在预层层面实现。

摘要:

我们回顾了几类有用的图的范畴,用于描述广义算盘的同伦相干版本(例如循环算盘、模算盘、properads等),并为其态射给出了新的统一定义。这使得直接的比较成为可能,我们利用它证明了广义算盘范畴间的某些自由-遗忘伴随关系可以在预层层面实现。这包括算盘与循环算盘、dioperads与增广循环算盘,以及轮式properads与模算盘之间的伴随关系。

英文摘要:

We recall several categories of graphs which are useful for describing homotopy-coherent versions of generalized operads (e.g. cyclic operads, modular operads, properads, and so on), and give new, uniform definitions for their morphisms. This allows for straightforward comparisons, and we use this to show that certain free-forgetful adjunctions between categories of generalized operads can be realized at the level of presheaves. This includes adjunctions between operads and cyclic operads, between dioperads and augmented cyclic operads, and betweeen wheeled properads and modular operads.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑