Related papers: n-Categories Admissible by n-graph
We present a homotopy theory for a weak version of modular operads whose compositions and contractions are only defined up to homotopy. This homotopy theory takes the form of a Quillen model structure on the collection of simplicial…
A braided monoidal category may be considered a $3$-category with one object and one $1$-morphism. In this paper, we show that, more generally, $3$-categories with one object and $1$-morphisms given by elements of a group $G$ correspond to…
It is well-known that reduced smooth orbifolds and proper effective foliation Lie groupoids form equivalent categories. However, for certain recent lines of research, equivalence of categories is not sufficient. We propose a notion of maps…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
This paper is a rather informal guide to some of the basic theory of 2-categories and bicategories, including notions of limit and colimit, 2-dimensional universal algebra, formal category theory, and nerves of bicategories. As is the way…
In this paper, we give a class of reconstructible graphs.
Actions of monoidal categories on categories, also known as actegories, have been familiar to category theorists for a long time, and yet a comprehensive overview of this topic seems to be missing from the literature. Recently, actegories…
The theory of $N$-complexes is a generalization of both ordinary chain complexes and graded objects. Hence it yields deeper insight in the structure of these and offers a broader range of applications. This work generalizes the tensor…
We define a free product of connected simple graphs that is equivalent to several existing definitions when the graphs are vertex-transitive but differs otherwise. The new definition is designed for the automorphism group of the free…
We introduce and develop the notion of *displayed categories*. A displayed category over a category C is equivalent to "a category D and functor F : D --> C", but instead of having a single collection of "objects of D" with a map to the…
A constructive characterization of the class of uniformly $4$-connected graphs is presented. The characterization is based on the application of graph operations to appropriate vertex and edge sets in uniformly $4$-connected graphs, that…
We give describe several models for $(\infty,n)$-categories, with an emphasis on models given by diagrams of sets and simplicial sets. We look most closely at the cases when $n \leq 2$, then summarize methods of generalizing for all $n$.
In this article we present a detailed study of the existing constructions of colilimits in the category of symmetrical operations. In addition, some examples of operads obtained from colimits of other operads are presented.
4-critical wheel graphs of higher order are considered concerning their belonging to free-planar or free-Hadwiger classes.
We define specific multiplicities on the braid arrangement by using edge-bicolored graphs. To consider their freeness, we introduce the notion of bicolor-eliminable graphs as a generalization of Stanley's classification theory of free…
A certain amount of category theory is developed in an arbitrary finitely complete category with a factorization system on it, playing the role of the comprehensive factorization system on Cat. Those aspects related to the concepts of…
In this paper we unify previous developments on higher operads and multitensors into a single framework in which the interplay between multitensors on a category V, and monads on the category of graphs enriched in V, is taken as…
Operads may be represented as symmetric monoidal functors on a small symmetric monoidal category. We discuss the axioms which must be imposed on a symmetric monoidal functor in order that it give rise to a theory similar to the theory of…
A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching. 1-Factor-critical graphs and 2-factor-critical graphs are…
The simplification of a multigraph into a simple graph can be abstracted to a more general comma category under some common conditions. When using the identity functor, the category of simple objects in a comma category generalizes the…