Related papers: Constructing Seifert surfaces from n-bridge link p…
We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…
Traditionally, alternating links are studied with alternating diagrams on $S^2$ in $S^3$. In this paper, we consider links which are alternating on higher genus surfaces $S_g$ in $S_g \times I$. We define what it means for such a link to be…
This paper contains the results of efforts to determine values of the smooth and the topological slice genus of 11- and 12-crossing knots. Upper bounds for these genera were produced by using a computer to search for genus one concordances…
Any 2-bridge knot in the 3-sphere has a bridge sphere from which any other bridge surface can be obtained by stabilization, meridional stabilization, perturbation and proper isotopy.
In our works with Stoimenow, Vdovina and with Byberi, we introduced the virtual canonical genus $g_{vc}(K)$ and the virtual bridge number $vb(K)$ invariants of virtual knots. One can see from the definitions that for an classical knot $K$…
The model of a topological quantum computer is a promising one due to its natural resistance to noise and other errors. Operations in such a computer are implemented by braiding the trajectories of anyons. While it is easy to understand how…
We construct a cobordism group for embedded graphs in two different ways, first by using sequences of two basic operations, called "fusion" and "fission", which in terms of cobordisms correspond to the basic cobordisms obtained by attaching…
Previous work used polygonal realizations of knots to reduce the problem of computing the superbridge number of a realization to a linear programming problem, leading to new sharp upper bounds on the superbridge index of a number of knots.…
We present an enhanced prime decomposition theorem for knots that gives the isotopy classes of composite knots that can be constructed from a given list of prime factors (allowing for the mirroring and orientation reversing for each…
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…
The fundamental group $\pi_1(L)$ of a knot or link $L$ may be used to generate magic states appropriate for performing universal quantum computation and simultaneously for retrieving complete information about the processed quantum states.…
In this article, we propose a new type of square matrix associated with an undirected graph by trading off the naturally imbedded symmetry in them. The proposed matrix is defined using the neighbourhood sets of the vertices. It is called as…
We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation…
We study the Seifert surfaces of a link by relating the embeddings of graphs by using induced graphs. As applications, we prove that every link $L$ is the boundary of an oriented surface which is obtained from a graph embedding of a…
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,…
We present an algorithm that takes as input any element $B$ of the loop braid group and constructs a polynomial $f:\mathbb{R}^5\to\mathbb{R}^2$ such that the intersection of the vanishing set of $f$ and the unit 4-sphere contains the…
We give the first analysis of the computational complexity of {\it coalition structure generation over graphs}. Given an undirected graph $G=(N,E)$ and a valuation function $v:2^N\rightarrow\RR$ over the subsets of nodes, the problem is to…
We continue the study of quantum A-polynomials -- equations for knot polynomials with respect to their coloring (representation-dependence) -- as the relations between different links, obtained by hanging additional ``simple'' components on…
Branchwidth determines how graphs, and more generally, arbitrary connectivity (basically symmetric and submodular) functions could be decomposed into a tree-like structure by specific cuts. We develop a general framework for designing…
We prove the meridional rank conjecture for twisted links and arborescent links associated to bipartite trees with even weights. These links are substantial generalizations of pretzels and two-bridge links, respectively. Lower bounds on…