相关论文: Markov theorem for transversal links

Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…

We review a braid theoretic self-linking number formula and study its applications.

A discrete-time Markov chain can be transformed into a new Markov chain by looking at its states along iterations of an almost surely finite stopping time. By the optional stopping theorem, any bounded harmonic function with respect to the…

A knot type is exchange reducible if an arbitrary closed n-braid representative can be changed to a closed braid of minimum braid index by a finite sequence of braid isotopies, exchange moves and +/- destabilizations. In the manuscript [J…

Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollary of these methods one obtains a probabilistic proof of…

For classical links Ohyama proved an inequality involving the minimal crossing number and the braid index, then motivated from this Takeda showed an analogous inequality for virtual links. In this paper, we are interested in studying…

In this paper we study the theory of knotoids and braidoids and the theory of pseudo knotoids and pseudo braidoids on the torus T. In particular, we introduce the notion of {\it mixed knotoids} in $S^2$, that generalize the notion of mixed…

In this paper we look at which Alexander and Markov theories can be defined for generalized knot theories

We give asymptotically sharp upper bounds for the Khovanov width and the dealternation number of positive braid links, in terms of their crossing number. The same braid-theoretic technique, combined with Ozsv\'ath, Stipsicz, and Szab\'o's…

This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the…

It was asked by J.Birman, Williams, and L.Rudolph whether nontrivial Lorentz knots have always positive signature. Lorentz knots are examples of positive braids (in our convention they have all crossings negative so they are negative…

Building further on work of Marin and Wagner, we give a cubic braid-type skein theory of the Links--Gould polynomial invariant of oriented links and prove that it can be used to evaluate any oriented link, adding this polynomial to the list…

It is shown that transient graphs for the simple random walk do not admit a nearest neighbor transient Markov chain (not necessarily a reversible one), that crosses all edges with positive probability, while there is such chain for the…

A knot K is called n-adjacent to another knot K', if K admits a projection containing n generalized crossings such that changing any 0 < m \leq n of them yields a projection of K'. We apply techniques from the theory of sutured 3-manifolds,…

Twisted links are a generalization of virtual links. As virtual links correspond to abstract links on orientable surfaces, twisted links correspond to abstract links on (possibly non-orientable) surfaces. In this paper, we introduce the…

Let $G$ be a finite group. Let $H, K$ be subgroups of $G$ and $H \backslash G / K$ the double coset space. Let $Q$ be a probability on $G$ which is constant on conjugacy classes ($Q(s^{-1} t s) = Q(t)$). The random walk driven by $Q$ on $G$…

Choose any oriented link type X and closed braid representatives X[+], X[-] of X, where X[-] has minimal braid index among all closed braid representatives of X. The main result of this paper is a `Markov theorem without stabilization'. It…

Two links are link-homotopic if they are transformed into each other by a sequence of self-crossing changes and ambient isotopies. The link-homotopy classes of 4-component links were classified by Levine with enormous algebraic…

Let $S$ be a set of transpositions generating the symmetric group $S_n$. The transposition graph of $S$ is defined to be the graph with vertex set $\{1,\ldots,n\}$, and with vertices $i$ and $j$ being adjacent in $T(S)$ whenever $(i,j) \in…

The Markov commutator associated to a finite Markov kernel P is the convex semigroup consisting of all Markov kernels commuting with P. Its interest comes from its relation with the hypergroup property and with the notion of Markovian…