Related papers: Symmetric monoidal extensions and graph cobordisms…

A classical result due to Lovasz (1967) shows that the isomorphism type of a graph is determined by homomorphism counts. That is, graphs G and H are isomorphic whenever the number of homomorphisms from K to G is the same as the number of…

We study cocompleteness, co-wellpoweredness and generators in the centralizer category of an object or morphism in a monoidal category, and the center or the weak center of a monoidal category. We explicitly give some answers for when…

Associated to each small category $C$, there is a category of $C$-shaped diagrams of simplicial sets and an $\infty$-category of $NC$-shaped homotopy coherent diagrams of spaces. We present a functor which exhibits the latter as the…

We present a method of constructing monoidal, braided monoidal, and symmetric monoidal bicategories from corresponding types of monoidal double categories that satisfy a lifting condition. Many important monoidal bicategories arise…

We point out that double categories provide a natural setting for modular functors obtained by a (bicategorical) string-net construction: The source of the modular functor -- which is now a double functor -- is a symmetric monoidal double…

For a finite group $G$, we define the $G$-cobordism category in dimension two. We show there is a one-to-one correspondence between the connected components of its classifying space and the abelianization of $G$. Also, we find an…

We introduce the category of singular 2-dimensional cobordisms and show that it admits a completely algebraic description as the free symmetric monoidal category on a twin Frobenius algebra, by providing a description of this category in…

This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…

We show that every braiding on a monoidal bicategory induces a monoidal structure on its bicategory of monoids, such that if the former is sylleptic or symmetric then the latter is braided or symmetric, respectively. This extends a classic…

We characterise when the pure monomorphisms in a presheaf category $\mathbf{Set}^\mathcal{C}$ are cofibrantly generated in terms of the category $\mathcal{C}$. In particular, when $\mathcal{C}$ is a monoid $S$ this characterises cofibrant…

The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…

We use Lurie's symmetric monoidal envelope functor to give two new descriptions of $\infty$-operads: as certain symmetric monoidal $\infty$-categories whose underlying symmetric monoidal $\infty$-groupoids are free, and as certain symmetric…

We study the symmetric monoidal 2-category of finite semisimple module categories over a symmetric fusion category. In particular, we study $E_n$-algebras in this 2-category and compute their $E_n$-centers for $n=0,1,2$. We also compute the…

The paper is devoted to a categorical study of the category of probabilistic metric spaces. The study is based on an isomorphic description of the category of probabilistic metric spaces. The isomorphic description was obtained in [3] and…

We give a counterexample to a conjecture by Miasnikov, Ventura and Weil, stating that an extension of free groups is algebraic if and only if the corresponding morphism of their core graphs is onto, for every basis of the ambient group. In…

We define the affinization of an arbitrary monoidal category $\mathcal{C}$, corresponding to the category of $\mathcal{C}$-diagrams on the cylinder. We also give an alternative characterization in terms of adjoining dot generators to…

We introduce monoidal width as a measure of the difficulty of decomposing morphisms in monoidal categories. For graphs, we show that monoidal width and two variations capture existing notions, namely branch width, tree width and path width.…

In the standard category of directed graphs, graph morphisms map edges to edges. By allowing graph morphisms to map edges to finite paths (path homomorphisms of graphs), we obtain an ambient category in which we determine subcategories…

Building on structure observed in equivariant homotopy theory, we define an equivariant generalization of a symmetric monoidal category: a $G$-symmetric monoidal category. These record not only the symmetric monoidal products but also…

We define and study a natural category of graph limits. The objects are pairs $(\pi,\mu)$, where $\pi$ (the distribution of vertices) is an abstract probability measure on some abstract measurable space $(X,\mathcal{A})$ and $\mu$ (the…