Related papers: Twisted Cubes and their Applications in Type Theor…
Target class classification is a mixed classification and transition model whose integrated goal is to assign objects to a certain, so called target or normal class. The classification process is iterative, and in each step an object in a…
We introduce a new notion of twisted actions of inverse semigroups and show that they correspond bijectively to certain regular Fell bundles over inverse semigroups, yielding in this way a structure classification of such bundles. These…
We study recursive-cube-of-rings (RCR), a class of scalable graphs that can potentially provide rich inter-connection network topology for the emerging distributed and parallel computing infrastructure. Through rigorous proof and validating…
We introduce a general framework to unify several variants of twisted topological $K$-theory. We focus on the role of finite dimensional real simple algebras with a product-preserving involution, showing that Grothendieck-Witt groups…
We develop foundations for oriented category theory, an extension of $(\infty,\infty)$-category theory obtained by systematic usage of the Gray tensor product, in order to study lax phenomena in higher category theory. As categorical…
We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…
Which polyominoes can be folded into a cube, using only creases along edges of the square lattice underlying the polyomino, with fold angles of $\pm 90^\circ$ and $\pm 180^\circ$, and allowing faces of the cube to be covered multiple times?…
The theory of composite mixtures consisting of $n$ constituents is framed within the schema provided by the notion of $n$-groupoid. The point of departure is the analysis of $n$-dimensional hypercubes and their skeletons, to each of whose…
In this paper we develop constructive invertibility conditions for the twisted convolution. Our approach is based on splitting the twisted convolution with rational parameters into a finite number of weighted convolutions, which can be…
This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…
In a previous paper we showed that the phase space of loop quantum gravity on a fixed graph can be parametrized in terms of twisted geometries, quantities describing the intrinsic and extrinsic discrete geometry of a cellular decomposition…
We define group-twisted Alexander-Whitney and Eilenberg-Zilber maps for converting between bimodule resolutions of skew group algebras. These algebras are the natural semidirect products recording actions of finite groups by automorphisms.…
This work arose from efforts to generalise the usual cubical boundary by using different 'weights' for opposite faces, but still to obtain a chain complex, and this method was found to generalise. We describe a variant of the classical…
Real-world graphs naturally exhibit hierarchical or cyclical structures that are unfit for the typical Euclidean space. While there exist graph neural networks that leverage hyperbolic or spherical spaces to learn representations that embed…
We consider two operations on an edge of an embedded graph (or equivalently a ribbon graph): giving a half-twist to the edge and taking the partial dual with respect to the edge. These two operations give rise to an action of S_3^{|E(G)|},…
Treewidth is a parameter that emerged from the study of minor closed classes of graphs (i.e. classes closed under vertex and edge deletion, and edge contraction). It in some sense describes the global structure of a graph. Roughly, a graph…
A common choice for the evolution of the knotted graphs in loop quantum gravity is to use the Pachner moves, adapted to graphs from their dual triangulations. Here, we show that the natural way to consistently use these moves is on framed…
How do vertices exert influence in graph data? We develop a framework for edge clustering, a new method for exploratory data analysis that reveals how both vertices and edges collaboratively accomplish directed influence in graphs,…
We introduce a twisted fiber bundle construction of quantum CSS codes over group algebras \(R=\mathbb F_2[G]\), where each base generator carries a generator-dependent \(R\)-linear fiber twist satisfying a flatness condition. This…
We introduce a new method for ``twisting'' relative equivalences of derived categories of sheaves on two spaces over the same base. The first aspect of this is that the derived categories of sheaves on the spaces are twisted. They become…