相关论文: Weak $\omega$-categories as $\omega$-hypergraphs
Lessard's $\mathbb{Z}$-categories are an analogue of $\omega$-categories possessing cells in all positive and negative dimensions. Categorical spectra, developed by Stefanich, are an analogue of spectra obtained by replacing the suspension…
Opetopes are algebraic descriptions of shapes corresponding to compositions in higher dimensions. As such, they offer an approach to higher-dimensional algebraic structures, and in particular, to the definition of weak $\omega$-categories,…
We study various acyclicity conditions on higher-categorical pasting diagrams in the combinatorial framework of regular directed complexes. We present an apparently weakest acyclicity condition under which the $\omega$-category presented by…
We consider four categories: the category of diagrams of small categories indexed by a given small category O, the (comma) category of small categories over O, the category of diagrams of simplicial sets indexed by O, and the category of…
In this paper we define a sequence of monads $\mathbb{T}^(\infty;n)$ $(n\in\mathbb{N})$ on $\infty$-$\mathbb{G}\text{r}$, the category of the $\infty$-graphs. We conjecture that algebras for $\mathbb{T}^(0;n)$ which are defined in a purely…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
In this paper we study categorical properties of the category of abelian hypergroups that leads to the notion of hyper (almost) preadditive and hyper (almost) abelian categories. Our goal is to create a path towards a general theory of…
Weak similarities form a special class of mappings between semimetric spaces. Two semimetric spaces $X$ and $Y$ are weakly similar if there exists a weak similarity $\Phi\colon X\to Y$. We find a structural characteristic of finite…
We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…
We give a new description of computads for weak globular $\omega$-categories by giving an explicit inductive definition of the free words. This yields a new understanding of computads, and allows a new definition of $\omega$-category that…
Constructing and manipulating homotopy types from categorical input data has been an important theme in algebraic topology for decades. Every category gives rise to a `classifying space', the geometric realization of the nerve. Up to weak…
We develop a direct method to recover an orthoalgebra from its poset of Boolean subalgebras. For this a new notion of direction is introduced. Directions are also used to characterize in purely order-theoretic terms those posets that are…
The relations, rather than the elements, constitute the structure of networks. We therefore develop a systematic approach to the analysis of networks, modelled as graphs or hypergraphs, that is based on structural properties of…
Hypergraphs are a powerful abstraction for modeling high-order relations, which are ubiquitous in many fields. A hypergraph consists of nodes and hyperedges (i.e., subsets of nodes); and there have been a number of attempts to extend the…
Real-world knowledge can take various forms, including structured, semi-structured, and unstructured data. Among these, knowledge graphs are a form of structured human knowledge that integrate heterogeneous data sources into structured…
An alternative foundation for 2-categories is explored by studying graph-theoretically a partial operation on 2-cells named juncture, which can replace vertical and horizontal composition. Juncture is a generalized vertical composition of…
In this work, we introduce a novel evaluation framework for generative models of graphs, emphasizing the importance of model-generated graph overlap (Chanpuriya et al., 2021) to ensure both accuracy and edge-diversity. We delineate a…
Higher dimensional automata, i.e. labelled precubical sets, model concurrent systems. We introduce the homology graph of an HDA, which is a directed graph whose nodes are the homology classes of the HDA. We show that the homology graph is…
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…
We show that the category of N-complexes has a Str\om model structure, meaning the weak equivalences are the chain homotopy equivalences. This generalizes the analogous result for the category of chain complexes (N = 2). The trivial objects…