arXiv research

Study uses Dynnikov coordinates to analyze actions of Dehn twists on a thrice-punctured disc.

The Dynnikov coordinate system puts global coordinates on the boundary of Teichmüller space of an $n$--punctured disk. We survey the Dynnikov coordinate system, and investigate how we use this coordinate system to study pseudo--Anosov braids making use of results from Thurston's theory on surface homeomorphisms.

We present an algorithm for calculating the geometric intersection number of two multicurves on the $n$-punctured disk, taking as input their Dynnikov coordinates. The algorithm has complexity $O(m^2n^4)$, where $m$ is the sum of the absolute values of the Dynnikov coordinates of the two multicurves. The main ingredien…

We generalize Dynnikov coordinate system previosly defined on the standard punctured disk to an orientable surface of genus-1 with n punctures and one boundary component.

Algorithm detects free products in disk mapping class groups.

We define Dynnikov coordinates on virtual braid groups. We prove that they are faithful invariants of virtual 2-braids, and present evidence that they are also very powerful invariants for general virtual braids.

We present an efficient algorithm for calculating the number of components of an integral lamination on an $n$-punctured disk, given its Dynnikov coordinates. The algorithm requires $O(n^2M)$ arithmetic operations, where $M$ is the sum of the absolute values of the Dynnikov coordinates.

Alternative proof of Dynnikov's three-page index for torus links.

Deep learning classifies knots using rectangular diagrams.

A knot is an an embedding of a circle into three-dimensional space. We say that a knot is unknotted if there is an ambient isotopy of the embedding to a standard circle. By representing knots via planar diagrams, we discuss the problem of unknotting a knot diagram when we know that it is unknotted. This problem is surp…

This note connects tiling billiards dynamics to Novikov's problem via helicoidal construction.

Study of Dehn twists on a disc with 3 points, solving conjugacy problem.

The main results of A. Zorich and I. Dynnikov about plane sections of periodic surfaces are extended to the PL case. As an application, the Stereographic Map of a truncated octahedron, extended to the whole $\Rt$ by periodicity, is analyzed numerically.

We give a recipe to compute the geometric intersection number of an integral lamination with a particular type of integral lamination on an n-times punctured disk. This provides a way to find the geometric intersection number of two arbitrary integral laminations when combined with an algorithm of Dynnikov and Wiest.

Let $N_{g,n}$ be an $n$--punctured non--orientable surface of genus $g$ with one boundary component. For $g\geq 2$ one of the generators of the mapping class group of $N_{g,n}$ is a crosscap transposition. We give explicit formulae for the action of crosscap transpositions and their inverses on the set of multicurves i…

If a rectangular diagram represents the trivial knot, then it can be deformed into the rectangular diagram with only two vertical edges by a finite sequence of merge operations and exchange operations, without increasing the number of vertical edges, which was shown by I. A. Dynnikov. We show in this paper that we need…

In a recent work of I.\,Dynnikov and M.\,Prasolov a new method of comparing Legendrian knots is proposed. In general, to apply the method requires a lot of technical work. In particular, one needs to search all rectangular diagrams of surfaces realizing certain dividing configurations. In this paper, it is shown that, …

In a recent work "Arc-presentation of links: Monotonic simplification" Ivan Dynnikov showed that each rectangular diagram of the unknot, composite link, or split link can be monotonically simplified into a trivial, composite, or split diagram, respectively. The following natural question arises: Is it always possible t…

New method confirms conjectures about specific Legendrian knots.

Few years ago we developed jointly with I.Dynnikov new discretization of complex analysis (DCA) based on the two-dimensional manifolds with colored black/white triangulation. Especially deep results were obtained for the Euclidean plane with equilateral triangle lattice. In the present work we develop a DCA theory for …

If a rectangular diagram represents the trivial knot, then it can be deformed into the trivial rectangular diagram with only four edges by a finite sequence of merge operations and exchange operations, without increasing the number of edges, which was shown by I. A. Dynnikov. Using this, Henrich and Kauffman gave an up…

Following the previous authors works (joint with I.A.Dynnikov) we develop a theory of the discrete analogs of the differential-geometrical (DG) connections in the triangulated manifolds. We study a nonstandard discretization based on the interpretation of DG Connection as linear first order (''triangle'') difference eq…

Finding appropriate notions of discrete holomorphic maps and, more generally, conformal immersions of discrete Riemann surfaces into 3-space is an important problem of discrete differential geometry and computer visualization. We propose an approach to discrete conformality that is based on the concept of holomorphic l…

Rectangular diagrams of links are link diagrams in the plane ${\mathbb R}^2$ such that they are composed of vertical line segments and horizontal line segments and vertical segments go over horizontal segments at all crossings. P. R. Cromwell and I. A. Dynnikov showed that rectangular diagrams of links are useful for d…

In this thesis we describe how to estimate the distance spanned in the pants graph by a train track splitting sequence on a surface, up to multiplicative and additive constants. If some moderate assumptions on a splitting sequence are satisfied, each vertex set of a train track in it will represent a vertex of a graph …