Related papers: Higher dimensional hypercategories
Higher-dimensional rewriting is founded on a duality of rewrite systems and cell complexes, connecting computational mathematics to higher categories and homotopy theory: the two sides of a rewrite rule are two halves of the boundary of an…
Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the…
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,…
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying themes of our investigation are various `nonpositive…
In many data-driven applications, higher-order relationships among multiple objects are essential in capturing complex interactions. Hypergraphs, which generalize graphs by allowing edges to connect any number of nodes, provide a flexible…
We define novel fully combinatorial models of higher categories. Our definitions are based on a connection of higher categories to "directed spaces". Directed spaces are locally modelled on manifold diagrams, which are stratifications of…
Many real-world phenomena are naturally modeled by graphs and networks. However, classical graph models are often limited to pairwise interactions and may not adequately capture the richer structures that arise in practice. Higher-order…
We introduce relative preresolving subcategories and precoresolving subcategories of an abelian category and define homological dimensions and codimensions relative to these subcategories respectively. We study the properties of these…
Network interactions that are nonlinear in the state of more than two nodes - also known as higher-order interactions - can have a profound impact on the collective network dynamics. Here we develop a coupled cell hypernetwork formalism to…
Hypergraph categories have been rediscovered at least five times, under various names, including well-supported compact closed categories, dgs-monoidal categories, and dungeon categories. Perhaps the reason they keep being reinvented is…
The purpose of this dissertation is to set up a theory of generalized operads and multicategories, and to use it as a language in which to propose a definition of weak n-category. Included is a full explanation of why the proposed…
Modeling higher-order interactions (HOI) has emerged as a crucial challenge in complex systems analysis, as many phenomena cannot be fully captured by pairwise relationships alone. Hypergraphs, which generalize graphs by allowing…
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…
We investigate the structure of isometric subgraphs of hypercubes (i.e., partial cubes) which do not contain finite convex subgraphs contractible to the 3-cube minus one vertex $Q^-_3$ (here contraction means contracting the edges…
Hypergraphs provide a natural way to represent polyadic relationships in network data. For large hypergraphs, it is often difficult to visually detect structures within the data. Recently, a scalable polygon-based visualization approach was…
Higher-order relations are widespread in nature, with numerous phenomena involving complex interactions that extend beyond simple pairwise connections. As a result, advancements in higher-order processing can accelerate the growth of…
We develop a description of higher gauge theory with higher groupoids as gauge structure from first principles. This approach captures ordinary gauge theories and gauged sigma models as well as their categorifications on a very general…
Higher-dimensional category theory is the study of n-categories, operads, braided monoidal categories, and other such exotic structures. Although it can be treated purely as an algebraic subject, it is inherently topological in nature: the…
This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…
Given a dimension function $\omega$, we define a notion of an $\omega$-vector weighted digraph and an $\omega$-equivalence between them. Then we establish a bijection between the weakly $(\mathbb{Z}/2)^n$-equivariant homeomorphism classes…