相关论文: Weak $\omega$-categories as $\omega$-hypergraphs
An identifying code of a graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have small domination number, this is not the case for the…
This paper adresses two issues in dealing with bicategories of fractions. The first is to introduce a set of conditions on a class of arrows in a bicategory which is weaker than the one given in Pronk, Etendues and stacks as bicategories of…
The purpose of this paper is to develop a homotopical algebra for graphs, relevant to zeta series and spectra of finite graphs. More precisely, we define a Quillen model structure in a category of graphs (directed and possibly infinite,…
We propose a notion of weak (n+k,n)-category, which we call (n+k,n)-Theta-spaces. The (n+k,n)-Theta-spaces are precisely the fibrant objects of a certain model category structure on the category of presheaves of simplicial sets on Joyal's…
Precategories generalize both the notions of strict $n$-category and sesquicategory: their definition is essentially the same as the one of strict $n$-categories, excepting that we do not require the various interchange laws to hold. Those…
This article develops a theory of cell combinatorics and cell 2-representations for differential graded 2-categories. We introduce two types of partial preorders, called the strong and weak preorder. We then analyse and compare them. The…
We introduce weak oddness $\omega_{\textrm w}$, a new measure of uncolourability of cubic graphs, defined as the least number of odd components in an even factor. For every bridgeless cubic graph $G$, $\rho(G)\le\omega_{\textrm…
We introduce acyclic polygraphs, a notion of complete categorical cellular model for (small) categories, containing generators, relations and higher-dimensional globular syzygies. We give a rewriting method to construct explicit acyclic…
Let $\beta>0$. Motivated by jumbled graphs defined by Thomason, the celebrated expander mixing lemma and Haemers's vertex separation inequality, we define that a graph $G$ with $n$ vertices is a weakly $(n,\beta)$-graph if $\frac{|X|…
We study $\omega$-equifibrations between weak $\omega$-categories in the sense of Batanin--Leinster. We define $\omega$-equifibrations as a natural weak $\omega$-categorical analogue of isofibrations between categories, and show that they…
Hypergraphs have emerged as a powerful modeling framework to represent systems with multiway interactions, that is systems where interactions may involve an arbitrary number of agents. Here we explore the properties of real-world…
Nonstandard graphs have been defined and examined in prior works. The present work does the same for nonstandard digraphs. Since digraphs have more structure than do graphs, the present discussion requires more complicated definitions and…
We study $\omega$-weak equivalences between weak $\omega$-categories in the sense of Batanin-Leinster. Our $\omega$-weak equivalences are strict $\omega$-functors satisfying essential surjectivity in every dimension, and when restricted to…
We introduce a taxonomy of interaction types and show that graphs are focal hypergraphs: every graph is canonically a focal hypergraph via its closed neighbourhood structure, and every graph dynamical model is a special case of the general…
We define weak units in a semi-monoidal 2-category $\CC$ as cancellable pseudo-idempotents: they are pairs $(I,\alpha)$ where $I$ is an object such that tensoring with $I$ from either side constitutes a biequivalence of $\CC$, and $\alpha:…
Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…
This paper introduces the notion of weakly globular double categories, a particular class of strict double categories, as a way to model weak 2-categories; it explores its use in defining a double category of fractions, and shows that the…
As an example of the categorical apparatus of pseudo algebras over 2-theories, we show that pseudo algebras over the 2-theory of categories can be viewed as pseudo double categories with folding or as appropriate 2-functors into…
The two pillars of Algebraic topology - Homology and homotopy theory rely on the availability of basic building blocks called cells. Cells take the form of simplexes, and have properties such as faces, sub-cells, convexity and…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…