Related papers: Over then Under Tangles
Curved algebras are algebras endowed with a predifferential, which is an endomorphism of degree -1 whose square is not necessarily 0. This makes the usual definition of quasi-isomorphism meaningless and therefore the homotopical study of…
We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have been recently applied to obtain various properties of…
Crossings of knot diagrams can be divided into classes (tribes) compatible with Reidemeister moves. Tribes can be considered as localization of the notion of weak chord index introduced by M. Xu. In the article we describe tribes of…
We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data…
Optimal transport (OT) is a powerful framework to compare probability measures, a fundamental task in many statistical and machine learning problems. Substantial advances have been made in designing OT variants which are either…
The orbifold/condensation completion procedure of defect topological quantum field theories can be seen as carrying out a lattice or state sum model construction internal to an ambient theory. In this paper, we propose a conceptual…
Graph machine learning has been extensively studied in both academia and industry. Although booming with a vast number of emerging methods and techniques, most of the literature is built on the in-distribution hypothesis, i.e., testing and…
We describe an algorithm that morphs between two planar orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$, while preserving planarity and orthogonality. Necessarily $\Gamma_I$ and $\Gamma_O$ share the same combinatorial…
While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of…
Optimal transport (OT) is a widely used technique for distribution alignment, with applications throughout the machine learning, graphics, and vision communities. Without any additional structural assumptions on trans-port, however, OT can…
Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks. This chapter provides an overview of graph…
We describe tilting modules of the deformed category O over a semisimple Lie algebra as certain sheaves on a moment graph associated to the corresponding block of category O. We prove that they map to Braden-MacPherson sheaves constructed…
Triangle listing is an important topic significant in many practical applications. Efficient algorithms exist for the task of triangle listing. Recent algorithms leverage an orientation framework, which can be thought of as mapping an…
A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…
Cloaking is a method of making obstacles undetectable. Here we cloak unit cells of a magnetic pattern squeezed into an otherwise periodic pattern from a magnetically driven colloidal flow. We apply a time-periodic external magnetic field…
Understanding the inner workings of neural networks, including transformers, remains one of the most challenging puzzles in machine learning. This study introduces a novel approach by applying the principles of gauge symmetries, a key…
We initiate the study of combinatorial algorithms for Triangle Detection in $H$-free graphs. The goal is to decide if a graph that forbids a fixed pattern $H$ as a subgraph contains a triangle, using only "combinatorial" methods that…
A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a thrackle drawing of a graph on the plane cannot have more edges than vertices. We prove the Conjecture for…
We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all…
Diagrammatic notation has become a ubiquitous computational tool; early examples include Penrose's graphical notation for tensor calculus, Feynman's diagrams for perturbative quantum field theory, and Cvitanovic's birdtracks for Lie…