相关论文: An alternating labeling on a spanning tree of Seif…

In this paper, we introduce a method, called a plat form, of describing a surface-link in the 4-space using a braided surface. We prove that every surface-link, which is not necessarily orientable, can be described in a plat form. The plat…

Knots and links which are closed 3-braids are a very special class. Like 2-bridge knots and links, they are simple enough to admit a complete classification. At the same time they are rich enough to serve as a source of examples on which,…

While the problem of computing the genus of a knot is now fairly well understood, no algorithm is known for its four-dimensional variants, both in the smooth and in the topological locally flat category. In this article, we investigate a…

New explicit procedures for passing among triplane diagrams, braid movies, and braid charts for knotted surfaces in $\mathbb{R}^4$ are presented. To this end, rainbow diagrams, which lie between braid charts and triplanes, are introduced.…

We consider a connected negative definite plumbing graph, and we assume that the associated plumbed 3-manifold is a rational homology sphere. We provide two new combinatorial formulae for the Seiberg-Witten invariant of this manifold. The…

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…

In this paper, we apply Kauffman bracket skein algebras to develop a theory of skein adequate links in thickened surfaces. We show that any alternating link diagram on a surface is skein adequate. We apply our theory to establish the first…

Given a knot in $S^3$, one can associate to it a surface diffeomorphism in two different ways. First, an arbitrary knot in $S^{3}$ can be represented by braids, which can be thought of as diffeomorphisms of punctured disks. Second, if the…

One of the main questions in the theory of normal surface singularities is to understand the relations between their geometry and topology. The lattice cohomology is an important tool in the study of topological properties of a plumbed…

Alternating-sign Hopf plumbing along a tree yields fibered alternating links whose homological monodromy is, up to a sign, conjugate to some alternating-sign Coxeter transformation. Exploiting this tie, we obtain results about the location…

Any knot $K$ in genus-$1$ $1$-bridge position can be moved by isotopy to lie in a union of $n$ parallel tori tubed by $n-1$ tubes so that $K$ intersects each tube in two spanning arcs, which we call a leveling of the position. The minimal…

The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain $m$-component $T^2$-link ($m \geq 3$) determined from two commutative pure $m$-braids…

This is the third of three papers that refine and extend portions of our earlier preprint, "The depth of a knot tunnel." Together, they rework the entire preprint. In this paper, we use the theory of tunnel number 1 knots that we introduced…

We prove that basket links, whose symmetrized Seifert form is congruent to the Cartan matrix of the simply laced Dynkin diagram $A_{n}$, are isotopic to the torus link $T(2,n+1)$. In addition, we provide examples of links, constructed by…

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

We define the {\it Wirtinger number} of a link, an invariant closely related to the meridional rank. The Wirtinger number is the minimum number of generators of the fundamental group of the link complement over all meridional presentations…

A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…

Given a knot or link in the form of plat closure of a braid, we describe an algorithm to obtain a braid representing the same knot or link with the standard closure, and vice-versa. We analyze the three cases of knots and links: in…

Let $\alpha$ be a map from the set of all knot types ${\mathcal K}$ to a set $X$. Let $\beta$ be a map from ${\mathcal K}$ to a set $Y$. We define the relation between $\alpha$ and $\beta$ to be the image of a map $(\alpha,\beta)$ from…

The main result of this paper is a new classification theorem for links (smooth embeddings in codimension 2). The classifying space is the rack space (defined in [Trunks and classifying spaces, Applied Categorical Structures, 3 (1995)…