Related papers: Twisted Cubes and their Applications in Type Theor…
Cube categories are used to encode higher-dimensional categorical structures. They have recently gained significant attention in the community of homotopy type theory and univalent foundations, where types carry the structure of such higher…
Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
Twisted hypercubes are graphs that generalize the structure of the hypercube by relaxing the symmetry constraint while maintaining degree-regularity and connectivity. We study the zero forcing number of twisted hypercubes. Zero forcing is a…
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…
The paper establishes an equivalence between directed homotopy categories of (diagrams of) cubical sets and (diagrams of) directed topological spaces. This equivalence both lifts and extends an equivalence between classical homotopy…
A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on contraction sequences. More precisely, if one puts red edges…
The main goal of the present paper is the construction of twisted generalized differential cohomology theories and the comprehensive statement of its basic functorial properties. Technically it combines the homotopy theoretic approach to…
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…
The quantum geometry arising in Loop Quantum Gravity has been known to semi-classically lead to generalizations of length-geometries. There have been several attempts to interpret these so called twisted geometries and understand their role…
In recent years, Homotopy Type Theory (HoTT) has had great success both as a foundation of mathematics and as internal language to reason about $\infty$-groupoids (a.k.a. spaces). However, in many areas of mathematics and computer science,…
We recapture Douglas' framework for twisted parametrized stable homotopy theory in the language of $\infty$- categories. A twisted spectrum is essentially a section of a bundle of presentable stable $\infty$-categories whose fiber is the…
We present Twisted Edges, a unified framework for designing Linked Knot (LK) structures using labeled non-manifold surface meshes. While the concept of edge twists, originating in topological graph theory, is foundational to these designs,…
We investigate connected cubic vertex-transitive graphs whose edge sets admit a partition into a $2$-factor $\mathcal{C}$ and a $1$-factor that is invariant under a vertex-transitive subgroup of the automorphism group of the graph and where…
In a simple drawing of a graph, any two edges intersect in at most one point (either a common endpoint or a proper crossing). A simple drawing is generalized twisted if it fulfills certain rather specific constraints on how the edges are…
Cubical type theories are designed around an abstract unit interval from which types of paths, used to represent equalities, are defined. Varying the operations available on this interval yields different type theories. A reversal is an…
The aim of this paper is to explain how, through the work of a number of people, some algebraic structures related to groupoids have yielded algebraic descriptions of homotopy n-types. Further, these descriptions are explicit, and in some…
Metrically homogeneous graphs are connected graphs which, when endowed with the path metric, are homogeneous as metric spaces. In this paper we introduce the concept of twisted automorphisms, a notion of isomorphism up to a permutation of…
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…
Directed Algebraic Topology is beginning to emerge from various applications. The basic structure we shall use for such a theory, a 'd-space', is a topological space equipped with a family of 'directed paths', closed under some operations.…