Related papers: Twisted Cubes and their Applications in Type Theor…
Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…
On a space of stable maps, the psi classes are modified by subtracting certain boundary divisors. The top products of modified psi classes, usual psi classes, and classes pulled back along the evaluation maps are called twisted descendants;…
We give a construction of cyclic cocycles on convolution algebras twisted by gerbes over discrete translation groupoids. For proper \'etale groupoids, Tu and Xu provide a map between the periodic cyclic cohomology of a gerbe-twisted…
Typed metagraphs are defined as hypergraphs with types assigned to hyperedges and their targets, and the potential to have targets of hyperedges connect to whole links as well as targets. Directed typed metagraphs (DTMGs) are introduced via…
Twisted Convolutional Networks (TCNs) are proposed as a novel deep learning architecture for classifying one-dimensional data with arbitrary feature order and minimal spatial relationships. Unlike conventional Convolutional Neural Networks…
We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…
We introduce a class of projected entangled pair states (PEPS) which is based on a group symmetry twisted by a 3-cocycle of the group. This twisted symmetry gives rise to a new standard form for PEPS from which we construct a family of…
Let $A$ be either a simplicial complex $K$ or a small category $\mathcal C$ with $V(A)$ as its set of vertices or objects. We define a twisted structure on $A$ with coefficients in a simplicial group $G$ as a function $$ \delta\colon…
In various approaches, data cubes are pre-computed in order to answer efficiently OLAP queries. The notion of data cube has been declined in various ways: iceberg cubes, range cubes or differential cubes. In this paper, we introduce the…
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in the presence of linked data structures, 2) shape analysis…
The aim of this article is to explain a philosophy for applying higher dimensional Seifert-van Kampen Theorems, and how the use of groupoids and strict higher groupoids resolves some foundational anomalies in algebraic topology at the…
Contraction of triangles is a standard operation in the study of cubic graphs, as it reduces the order of the graph while typically preserving many of its properties. In this paper, we investigate the converse problem, wherein certain…
Flip graphs are a ubiquitous class of graphs, which encode relations induced on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance, are the graphs induced by quadrilateral flips in…
We develop a general diagrammatic theory of welded graphs, and provide an extension of Satoh's Tube map from welded graphs to ribbon surface-links. As a topological application, we obtain a complete link-homotopy classification of so-called…
The theory of classical types of curves in normed planes is not strongly developed. In particular, the knowledge on existing concepts of curvatures of planar curves is widespread and not systematized in the literature. Giving a…
We introduce the concept of pseudotwistor (with particular cases called twistor and braided twistor) for an algebra $(A, \mu, u)$ in a monoidal category, as a morphism $T:A\otimes A\to A\otimes A$ satisfying a list of axioms ensuring that…
Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a special kind of simple drawings that we call generalized…
The second author showed how Katsura's construction of the C*-algebra of a topological graph E may be twisted by a Hermitian line bundle L over the edge space E. The correspondence defining the algebra is obtained as the completion of the…
This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…
Given a presentably symmetric monoidal $\infty$-category $\mathcal{C}$ and an $\mathbb{E}_{\infty}$-monoid $M$, we introduce and classify twisted graded categories, which generalize the Day convolution structure on $\mathrm{Fun}(M,…