Related papers: A graphical calculus for tangles in surfaces
The affine Hecke algebra $\dot H_n$ of type $A$ is often presented as a quotient of the braid algebra of $n$-braids in the annulus. This leads to diagrammatic representations in terms of braids in the annulus, subject to a quadratic…
In this article we discuss classical theorems from Convex Geometry in the context of topological drawings and beyond. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one point: either a common vertex…
This paper extends the decorated Teichm\"uller theory developed before for punctured surfaces to the setting of ``bordered'' surfaces, i.e., surfaces with boundary, and there is non-trivial new structure discovered. The main new result…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
We introduce the description of a Wilson surface as a 2-dimensional topological quantum field theory with a 1-dimensional Hilbert space. On a closed surface, the Wilson surface theory defines a topological invariant of the principal…
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…
In this paper we introduce a representation of knots and links called a cube diagram. We show that a property of a cube diagram is a link invariant if and only if the property is invariant under two types of cube diagram operations. A knot…
We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…
We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…
We show that an arbitrary infinite graph can be compactified by its ${\aleph_0}$-tangles in much the same way as the ends of a locally finite graph compactify it in its Freudenthal compactification. In general, the ends then appear as a…
Doubly periodic tangles (DP tangles) are configurations of curves embedded in the thickened plane, invariant under translations in two transversal directions. In this paper we extend the classical theory of DP tangles by introducing the…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
A thrackle is a drawing of a graph on a surface such that (i) adjacent edges only intersect at their common vertex; and (ii) nonadjacent edges intersect at exactly one point, at which they cross. Conway conjectured that if a graph with $n$…
We introduce the Plaque Topology on the inverse limit of a branched covering self-map of a Riemann surface of a finite degree greater than one. We present the notions of regular and irregular points in the setting of this Plaque Inverse…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…
Given a closed symplectic 4-manifold $(X,\omega)$, we define a twisted version of the Gromov-Taubes invariants for $(X,\omega)$, where the twisting coefficients are induced by the choice of a surface bundle over $X$. Given a fibered…
By considering graphs as discrete analogues of Riemann surfaces, Baker and Norine (Adv. Math. 2007) developed a concept of linear systems of divisors for graphs. Building on this idea, a concept of gonality for graphs has been defined and…
We generalize Milnor link invariants to all types of surface-links in $4$--space (possibly with boundary). This is achieved by using the notion of cut-diagram, which is a 2-dimensional generalization of Gauss diagrams, associated to…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
Grid states form a discrete set of mixed quantum states that can be described by graphs. We characterize the entanglement properties of these states and provide methods to evaluate entanglement criteria for grid states in a graphical way.…