Related papers: Twisted Cubes and their Applications in Type Theor…
We present a graph theory-based method to characterise flow defects and structural shifts in condensed matter. We explore the connection between dynamical properties, particularly the recently introduced concept of ''softness'', and…
We give a unified description of twisted forms of classical reductive groups schemes. Such group schemes are constructed from algebraic objects of finite rank, excluding some exceptions of small rank. These objects, augmented odd form…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
We construct a braided structure on the algebra of K\"ahler differential forms of a commutative algebra twisted by an endomorphism. This generalises the construction done in M. Karoubi, Quantum Methods in Algebraic Topology, see…
This paper sets out basic properties of motivic twisted K-theory with respect to degree three motivic cohomology classes of weight one. Motivic twisted K-theory is defined in terms of such motivic cohomology classes by taking pullbacks…
In this paper, we develop twisted $K$-theory for stacks, where the twisted class is given by an $S^1$-gerbe over the stack. General properties, including the Mayer-Vietoris property, Bott periodicity, and the product structure $K^i_\alpha…
Daisy cubes are a recently introduced class of isometric subgraphs of hypercubes $Q_n$. They are induced with intervals between chosen vertices of $Q_n$ and the vertex $0^n\in V(Q_n)$. In this paper we characterize daisy cubes in terms of…
Graph transformers are a recent advancement in machine learning, offering a new class of neural network models for graph-structured data. The synergy between transformers and graph learning demonstrates strong performance and versatility…
This thesis provides an introduction to the various category theory ideas employed in topological quantum field theory. These theories are viewed as symmetric monoidal functors from topological cobordism categories into the category of…
Partial cubes are graphs isometrically embeddable into hypercubes. In this paper it is proved that every cubic, vertex-transitive partial cube is isomorphic to one of the following graphs: $K_2 \, \square \, C_{2n}$, for some $n\geq 2$, the…
The purpose of this paper is to give a twisted version of the Eynard-Orantin topological recursion by a 2D Topological Quantum Field Theory. We define a kernel for a 2D TQFT and use an algebraic definition for a topological recursion to…
Twisted complex $K$-theory can be defined for a space $X$ equipped with a bundle of complex projective spaces, or, equivalently, with a bundle of C$^*$-algebras. Up to equivalence, the twisting corresponds to an element of $H^3(X;\Z)$. We…
We outline the main features of the definitions and applications of crossed complexes and cubical $\omega$-groupoids with connections. These give forms of higher homotopy groupoids, and new views of basic algebraic topology and the…
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
This paper introduces the concept of distorted monoidal categories, a generalization of monoidal and braided monoidal categories that supports non-reversible and direction-sensitive tensor structures. Unlike the classical setting, where the…
Graph clustering, which aims to divide nodes in the graph into several distinct clusters, is a fundamental yet challenging task. Benefiting from the powerful representation capability of deep learning, deep graph clustering methods have…
Topological data analysis leverages topological features to analyze datasets, with applications in diverse fields like medical sciences and biology. A key tool of this theory is the persistence diagram, which encodes topological information…
We study the vertices of the polytopes of all affine maps (a.k.a. hom-polytopes) between higher dimensional simplices, cubes, and crosspolytopes. Systematic study of general hom-polytopes was initiated in [3]. The study of such vertices is…
In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…
A toric cube is a subset of the standard cube defined by binomial inequalities. These basic semialgebraic sets are precisely the images of standard cubes under monomial maps. We study toric cubes from the perspective of topological…