Related papers: A classification of spanning surfaces for alternat…
Let $F$ be an incompressible, meridionally incompressible and not boundary-parallel surface with boundary in the complement of an algebraic tangle $(B,T)$. Then $F$ separates the strings of $T$ in $B$ and the boundary slope of $F$ is…
Rank-based linkage is a new tool for summarizing a collection $S$ of objects according to their relationships. These objects are not mapped to vectors, and ``similarity'' between objects need be neither numerical nor symmetrical. All an…
Roberts proved that a family of alternating, arborescent, prime knots each have at least $2^{2n-1}$ distinct minimal genus Seifert surfaces, where $n$ is the genus of the knot in question. We give a subfamily of these knots that have…
The slope conjecture gives a precise relation between the degree of the colored Jones polynomial of a knot and the boundary slopes of essential surfaces in the knot complement. In this note we propose a generalization of the slope…
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…
We generalize H. Seifert's algorithm for finding a Seifert surface for a knot or link. The generalization applies to "framed oriented measured lamination links." For knots, a Seifert surface determines a unique framing. In our setting, we…
Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a connected bounded-degree…
We prove that the spanning trees of any outerplanar triangulation $G$ can be listed so that any two consecutive spanning trees differ in an exchange of two edges that share an end vertex. For outerplanar graphs $G$ with faces of arbitrary…
In this paper, we give a classification of link diagrams on nonorientable surfaces up to region crossing changes.
We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…
The paper introduces a number of structural and functional features of classification of multilayer networks (MLN), by means of which distinguish monoflow partially overlapped MLN, that are quite common in the study of intersystem…
Connectivity queries, which check whether vertices belong to the same connected component, are fundamental in graph computations. Sliding window connectivity processes these queries over sliding windows, facilitating real-time streaming…
We show that the link cobordism maps defined by the author are graded and satisfy a grading change formula. Using the grading change formula, we prove a new bound for $\Upsilon_K(t)$ for knot cobordisms in negative definite 4-manifolds. As…
By applying Seifert's algorithm to a special alternating diagram of a link L, one obtains a Seifert surface F of L. We show that the support of the sutured Floer homology of the sutured manifold complementary to F is affine isomorphic to…
A {\em $1-$vertex triangulation} of an oriented compact surface $S$ of genus $g$ is an embedded graph $T\subset S$ with a unique vertex such that all connected components of $S\setminus T$ are triangles (adjacent to exactly 3 edges of $T$).…
The paper discusses the classification of surfaces of degree 10 and sectional genus 9 and 10. The surfaces of degree at most 9 are described through classical work dating from the last century up to recent years, while surfaces of degree 10…
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…
We construct ribbon surfaces of Euler characteristic one for several infinite families of alternating 3-braid closures. We also use a twisted Alexander polynomial obstruction to conclude the classification of smoothly slice knots which are…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
We introduce a new construction of a surface link in the 4-space. We construct a surface link as a branched covering over the standard torus, which we call a torus-covering link. We show that a certain torus-covering $T^2$-link is…