Related papers: Braided chord diagrams
For any finite-dimensional vector space ${\mathcal F}$ of continuous functions $f:{\mathbb R}^1 \to {\mathbb R}^1$ consider subspaces in ${\mathcal F}$ defined by systems of {\em equality conditions} $f(a_i) = f(b_i)$, where $(a_i, b_i)$,…
We introduce the warping matrix which is a new description of oriented knots from a viewpoint of warping degree.
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…
To an oriented link in a solid torus we associate a trace graph in a thickened torus in such a way that links are isotopic if and only if their trace graphs can be related by moves of finitely many standard types. The key ingredient is a…
We consider a graph called a lattice diagram, which is a graph in the $xy$-plane such that each edge is parallel to the $x$-axis or the $y$-axis. In [4], we investigated transformations of certain lattice diagrams, and we considered the…
We study 3-braid knots of finite smooth concordance order. A corollary of our main result is that a chiral 3-braid knot of finite concordance order is ribbon.
Finite-order invariants of knots in arbitrary 3-manifolds (including non-orientable ones) are constructed and studied by methods of the topology of discriminant sets. Obstructions to the integrability of admissible weight systems to…
By a fixed continuous map from a $3$-space to itself, a knot in the $3$-space may be mapped to another knot in the $3$-space. We analyze possible knot types of them. Then we map a knot repeatedly by a fixed continuous map and analyze…
We extend knot contact homology to a theory over the ring $\mathbb{Z}[\lambda^{\pm 1},\mu^{\pm 1}]$, with the invariant given topologically and combinatorially. The improved invariant, which is defined for framed knots in $S^3$ and can be…
Even though chord roots constitute a fundamental concept in music theory, existing models do not explain and determine them to full satisfaction. We present a new method which takes sequential context into account to resolve ambiguities and…
We introduce a method of computing biquandle brackets of oriented knots and links using a type of decorated trivalent spatial graphs we call trace diagrams. We identify algebraic conditions on the biquandle bracket coefficients for moving…
Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes even linear-time) solvable on graphs of bounded treewidth. On…
Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function.…
Tied links and the tied braid monoid were introduced recently by the authors and used to define new invariants for classical links. Here, we give a version purely algebraic-combinatoric of tied links. With this new version we prove that the…
This paper continues the study of finite-type invariants of homology spheres studied by Ohtsuki and Garoufalidis. We apply the surgery classification of links to give a diagrammatic description, using ideas of Ohtsuki. This uses a…
In this article, the enumeration of partial chord diagrams is discussed via matrix model techniques. In addition to the basic data such as the number of backbones and chords, we also consider the Euler characteristic, the backbone spectrum,…
In this short note, we find the number of forests of chord diagrams with a given number of trees and a given number of chords.
We show that Vassiliev invariants separate braids on a closed oriented surface, and we exhibit an universal Vassiliev invariant for these braids in terms of chord diagrams labeled by elements of the fundamental group of the considered…
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
We partially determine grid homology (combinatorial knot Floer homology) of diagonal knots, which are conjectured to be equivalent to positive braid knots, by exploiting nice grid diagrams. Its next-to-top term detects the number of prime…