相关论文: n-Categories Admissible by n-graph

Many people have proposed definitions of `weak n-category'. Ten of them are presented here. Each definition is given in two pages, with a further two pages on what happens when n = 0, 1, or 2. The definitions can be read independently.…

The category of (colored) props is an enhancement of the category of colored operads, and thus of the category of small categories. The titular category has nice formal properties: it is bicomplete and is a symmetric monoidal category, with…

We are checking the closed categories beginning with the category of sets and ending with the category of categories. The novelty is a generalizing the notion of adjoint functors to the joint pair of functors in the category of directed…

We give a parametrization of cyclic pointed categories associated to the cyclic group of order $n$ in terms of $n$-th roots of unity. We also provide a diagramatic description of these categories by generators and relations, and use it to…

Knopfmacher et all [1] was introduced the graph compositions` notion. In this note we add to these a new construction of tree-like graphs where nodes are graphs themselves. The first examples of these tree-like compositions, a corresponding…

A graph G on n vertices is said to be extendable if G can be modified to form a new graph H on more than n vertices, while preserving the degrees of the vertices common to G and H. The added vertices all have the same degree and we define…

We describe a Grothendieck construction for non-symmetric operads with values in categories, and hence in groupoids and posets. The construction produces a 2-category which is operadically fibered over the category D of finite non-empty…

We define notions of direct and inverse limits in an $n$-category. We prove that the $n+1$-category $nCAT'$ of fibrant $n$-categories admits direct and inverse limits. At the end we speculate (without proofs) on some applications of the…

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

For a collection of subcategories satisfying a fixed set of conditions, for example thick subcategories of a triangulated category, we define a topological space called classifying space of subcategories. We show that this space classifies…

A near-group category is an additively semisimple category with a product such that all but one of the simple objects is invertible. We classify braided structures on near-group categories, and give explicit numerical formulas for their…

Written to be contributed as the "mathematical modeling" chapter of a book, edited by Elaine Landry, to be titled "Categories for the Working Philosopher". In this chapter, category theory is presented as a mathematical modeling framework…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

We define for each $n \geq 1$ a symmetric monoidal $(\infty, n+1)$-category $n\mathrm{Pr}^L$ whose objects we call presentable $(\infty,n)$-categories, generalizing the usual theory of presentable $(\infty,1)$-categories. We show that each…

In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations…

We introduce a representation via (n+1)-colored graphs of compact n-manifolds with (possibly empty) boundary, which appears to be very convenient for computer aided study and tabulation. Our construction is ageneralization to arbitrary…

We show that a certain class of categorical operads give rise to $E_n$-operads after geometric realization. The main arguments are purely combinatorial and avoid the technical topological assumptions otherwise found in the literature.

We address the fact that composition in an opetopic weak n-category is in general not unique and hence is not a well-defined operation. We define composition with a given k-cell in an n-category by a span of (n-k)-categories. We…

T*-categories are introduced as a ternary generalization of C*-categories. Their linking C*-categories are constructed and the Gelfand-Naimark representation theorems of Zettl for C*-ternary rings and for W*-ternary rings, are generalized…

We introduce, for every positive integer n, the notion of an n-relative category and show that the category of the small n-relative categories is a model for the homotopy theory of n-fold homotopy theories, i.e. homotopy theories of ... of…