相关论文: Dendroidal Sets
Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…
We define the notion of a multi-sorted algebraic theory, which is a generalization of an algebraic theory in which the objects are of different "sorts." We prove a rigidification result for simplicial algebras over these theories, showing…
We construct and study projective and Reedy model category structures for bimodules and infinitesimal bimodules over topological operads. Both model structures produce the same homotopy categories. For the model categories in question, we…
Using suitable deformations of simplicial trees and the duality theory for median sets, we show that every free action on a median set can be extended to a free and transitive one. We also prove that the category of median groups is a…
We introduce a notion of $n$-commutativity ($0\le n\le \infty$) for cosimplicial monoids in a symmetric monoidal category ${\bf V}$, where $n=0$ corresponds to just cosimplicial monoids in ${\bf V,}$ while $n=\infty$ corresponds to…
Knop constructed a tensor category associated to a finitely-powered regular category equipped with a degree function. In recent work with Harman, we constructed a tensor category associated to an oligomorphic group equipped with a measure.…
In this paper we first give a simplicial approach to the definition of a non strict $n$-category that we call an $n$-nerve following the idea that a category could be interpreted as a simplicial set, and we prove that our construction…
This is a sequel to a previous paper, developing an intrinsic, combinatorial homotopy theory for simplicial complexes; the latter form the cartesian closed subcategory of 'simple presheaves' in !Smp, the topos of symmetric simplicial sets,…
It is known that the notion of graded differential algebra coincides with the notion of monoid in the monoidal category of complexes. By using the monoidal structure introduced by M. Kapranov for the category of $N$-complexes we define the…
We put a monoidal model category structure on the category of chain complexes of quasi-coherent sheaves over a quasi-compact and semi-separated scheme X. The approach generalizes and simplifies methods used by the author to build monoidal…
This paper develops the foundations of a simplicial theory of weak omega-categories, which builds upon the insights originally expounded by Ross Street in his 1987 paper on oriented simplices. The resulting theory of weak complicial sets…
We apply the recently introduced notion, due to Dyckerhoff, Kapranov and Schechtman, of $N$-spherical functors of stable infinity categories, which generalise spherical functors, to the setting of monoidal categories. We call an object…
Categorical aspects of the theory of modules over trusses are studied. Tensor product of modules over trusses is defined and its existence established. In particular, it is shown that bimodules over trusses form a monoidal category. Truss…
The purpose of this note is to point out that simplicial methods and the well-known Dold-Kan construction in simplicial homotopy theory can be fruitfully applied to convert link homology theories into homotopy theories. Dold and Kan prove…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
Transformational music theory mainly deals with group and group actions on sets, which are usually constituted by chords. For example, neo-Riemannian theory uses the dihedral group D24 to study transformations between major and minor…
The most natural notion of a simplicial nerve for a (weak) bicategory was given by Duskin, who showed that a simplicial set is isomorphic to the nerve of a $(2,1)$-category (i.e. a bicategory with invertible $2$-morphisms) if and only if it…
We introduce monoidal width as a measure of complexity for morphisms in monoidal categories. Inspired by well-known structural width measures for graphs, like tree width and rank width, monoidal width is based on a notion of syntactic…
We develop a rigidity criterion to show that in simplicial model categories with a compatible symmetric monoidal structure, operad structures can be automatically lifted along certain maps. This is applied to obtain an unpublished result of…
We show that the classification diagram of a relative $\infty$-category arising from a relative simplicial category is equivalent to the levelwise nerve. Applications include the comparison of the diagonal of the levelwise nerve and the…