Related papers: Manifold Diagrams for Higher Categories
Wiring diagrams usually serve as a tool in the study of arrangements of lines and pseudolines. In this paper we go in the opposite direction, using known properties of line arrangements to motivate certain equivalence relations and actions…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
We present a computational implementation of diagrammatic sets, a model of higher-dimensional diagram rewriting that is "topologically sound": diagrams admit a functorial interpretation as homotopies in cell complexes. This has potential…
In this paper we give a summary of the comparisons between different definitions of so-called (\infty,1)-categories, which are considered to be models for \infty-categories whose n-morphisms are all invertible for n>1. They are also, from…
Perceptual manifolds arise when a neural population responds to an ensemble of sensory signals associated with different physical features (e.g., orientation, pose, scale, location, and intensity) of the same perceptual object. Object…
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.…
Topology diagrams are widely seen in power system applications, but their automatic generation is often easier said than done. When facing power transmission systems with strongly-meshed structures, existing approaches can hardly produce…
Thomason's Homotopy Colimit Theorem has been extended to bicategories and this extension can be adapted, through the delooping principle, to a corresponding theorem for diagrams of monoidal categories. In this version, we show that the…
The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…
Given a diagram of rings, one may consider the category of modules over them. We are interested in the homotopy theory of categories of this type: given a suitable diagram of model categories M(s) (as s runs through the diagram), we…
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…
An n-category is some sort of algebraic structure consisting of objects, morphisms between objects, 2-morphisms between morphisms, and so on up to n-morphisms, together with various ways of composing them. We survey various concepts of…
We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…
Let $X$ be a finite set and let $\mathsf{Mat}_X(\mathbb{C})$ denote the algebra of matrices with rows and columns indexed by $X$ and entries from the complex numbers acting on $\mathbb{C}^X$ with standard basis $\{ \hat{x} \mid x\in X\}$.…
Many definitions of weak and strict $\infty$-categories have been proposed. In this paper we present a definition for $\infty$-categories with strict associators, but which is otherwise fully weak. Our approach is based on the existing type…
We present a framework for analyzing collections of interacting hysterons through the lens of catastrophe theory. By modeling hysteron dynamics as a gradient system, we show how to construct hysteron transition graphs by characterizing the…
We show that for a wide class of manifold pairs N, M satisfying dim(M) = dim(N) + 1, every \pi_1-injective map f : N --> M factorises up to homotopy as a finite cover of an embedding. This result, in the spirit of Waldhausen's torus…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…