相关论文: Weak $\omega$-categories as $\omega$-hypergraphs
Networks are often studied as graphs, where the vertices stand for entities in the world and the edges stand for connections between them. While relatively easy to study, graphs are often inadequate for modeling real-world situations,…
Given an $r$-uniform hypergraph $H=(V,E)$ and a weight function $\omega:E\to\{1,\dots,w\}$, a coloring of vertices of $H$, induced by $\omega$, is defined by $c(v) = \sum_{e\ni v} w(e)$ for all $v\in V$. If there exists such a coloring that…
A hypergraph is a $T_0$-hypergraph if for every two different vertices of the hypergraph there exists an edge containing one of the vertices and not containing the other. A general method for the enumeration of certain classes of…
If M is a model category and Z is an object of M, then there are model category structures on the category of objects of M over Z and the category of objects of M under Z under which a map is a cofibration, fibration, or weak equivalence if…
In this article we introduce the notion of weak harmonic labeling of a graph, a generalization of the concept of harmonic labeling defined recently by Benjamini et al. that allows extension to finite graphs and graphs with leaves. We…
We introduce a notion of a filtered model structure and use this notion to produce various model structures on pro-categories. This framework generalizes several known examples. We give several examples, including a homotopy theory for…
We present a conservative extension ICaTT of the dependent type theory CaTT for weak $\omega$-categories with a type witnessing coinductive invertibility of cells. This extension allows for a concise description of the "walking equivalence"…
We study the dependent type theory CaTT, introduced by Finster and Mimram, which presents the theory of weak $\omega$-categories, following the idea that type theories can be considered as presentations of generalized algebraic theories.…
In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in…
Many definitions of weak n-category have been proposed. It has been widely observed that each of these definitions is of one of two types: algebraic definitions, in which composites and coherence cells are explicitly specified, and…
The notion of $\textbf{Gray}$-category, a semi-strict $3$-category in which the middle four interchange is weakened to an isomorphism, is central in the study of three-dimensional category theory. In this context it is common practice to…
To a bicomplex one can associate two natural filtrations, the column and row filtrations, and then two associated spectral sequences. This can be generalized to $N$-multicomplexes. We present a family of model category structures on the…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
Poly-bicategories generalise planar polycategories in the same way as bicategories generalise monoidal categories. In a poly-bicategory, the existence of enough 2-cells satisfying certain universal properties (representability) induces…
Batanin defines a weak $\omega$-category as an algebra for a certain operad. Leinster refines this idea and defines the weak $\omega$-category operad as the initial object of a category of "operads with contraction". We demonstrate how a…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…
We introduce a dependent type theory whose models are weak {\omega}-categories, generalizing Brunerie's definition of {\omega}-groupoids. Our type theory is based on the definition of {\omega}-categories given by Maltsiniotis, himself…
We introduce $\omega$-catoids as generalisations of (strict) $\omega$-categories and in particular the higher path categories generated by computads or polygraphs in higher-dimensional rewriting. We also introduce $\omega$-quantales that…
We generalise the concepts introduced by Baez and Dolan to define opetopes constructed from symmetric operads with a category, rather than a set, of objects. We describe the category of 1-level generalised multicategories, a special case of…
Biological and cellular systems are often modeled as graphs in which vertices represent objects of interest (genes, proteins, drugs) and edges represent relational ties among these objects (binds-to, interacts-with, regulates). This…