Related papers: Diagrams of divide links
Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…
A linear-time algorithm for generating auxiliary subgraphs for the 3-edge-connected components of a connected multigraph is presented. The algorithm uses an innovative graph contraction operation and makes only one pass over the graph. By…
For a connected graph G=(V,E), a subset U of V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. We show that the problem to test whether a graph has a disconnected cut is…
We introduce a technique called graph fission which takes in a graph which potentially contains only one observation per node (whose distribution lies in a known class) and produces two (or more) independent graphs with the same node/edge…
Obtaining complete information about the shape of an object by looking at it from a single direction is impossible in general. In this paper, we theoretically study obtaining differential geometric information of an object from orthogonal…
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…
This paper is a survey of knot theory and invariants of knots and links from the point of view of categories of diagrams. The topics range from foundations of knot theory to virtual knot theory and topological quantum field theory.
Bach et al. [1] recently presented an algorithm for constructing confluent drawings, by leveraging power graph decomposition to generate an auxiliary routing graph. We identify two issues with their method which we call the node split and…
Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…
Jin and Lee proved the following: Suppose that $D_1, \dots, D_n$ are link diagrams. Given a link $L$ which is partitioned into sublinks $L_1, \dots, L_n$ admitting diagrams $D_1, \dots, D_n$ respectively, there is a diagram $D$ of $L$ whose…
A link stream is a set of possibly weighted triplets (t, u, v) modeling that u and v interacted at time t. Link streams offer an effective model for datasets containing both temporal and relational information, making their proper analysis…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
A theorem of Mumford states that, on complex surfaces, any normal isolated singularity whose link is diffeomorphic to a sphere is actually a smooth point. While this property fails in higher dimensions, McLean asks whether the contact…
A graph multilink is a link with multiplicities in a homology 3-sphere whose exterior is a graph manifold. In this Note, we compute the Novikov homology of graph multilinks. As a corollary, we give a majoration for the number of Novikov…
We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…
We give a visual construction of stable maps from the $3$-sphere into the real plane enjoying the following properties; the set of definite fold points coincides with a given two-bridge link and the map only admits certain types of fibers…
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
The notion of Zariski pairs for projective curves in $\mathbb P^2$ is known since the pioneer paper of Zariski \cite{Zariski} and for further development, we refer the reference in \cite{Bartolo}.In this paper, we introduce a notion of…
In this work, we are interested in structure learning for a set of spatially distributed dynamical systems, where individual subsystems are coupled via latent variables and observed through a filter. We represent this model as a directed…