相关论文: The Intersection Graph Conjecture for Loop Diagram…

An intersection graph of curves in the plane is called a string graph. Matousek almost completely settled a conjecture of the authors by showing that every string graph of m edges admits a vertex separator of size O(\sqrt{m}\log m). In the…

We study the asymptotic distributions of the number of crossings and the number of simple chords in a random chord diagram. Using size-bias coupling and Stein's method, we obtain bounds on the Kolmogorov distance between the distribution of…

Vassiliev's spectral sequence for long knots is discussed. Briefly speaking we study what happens if the strata of non-immersions are ignored. Various algebraic structures on the spectral sequence are introduced. General theorems about…

Linear chord diagrams are partitions of $\left[2n\right]$ into $n$ blocks of size two called chords. We refer to a block of the form $\{i,i+1\}$ as a short chord. In this paper, we study the distribution of the number of short chords on the…

Many invariants of knots rely upon smoothing the knot at its crossings. To compute them, it is necessary to know how to count the number of connected components the knot diagram is broken into after the smoothing. In this paper, it is shown…

The values that the first two Vassiliev invariants take on prime knots with up to fourteen crossings are considered. This leads to interesting fish-like graphs. Several results about the values taken on torus knots are proved.

We review quantum field theory approach to the knot theory. Using holomorphic gauge we obtain the Kontsevich integral. It is explained how to calculate Vassiliev invariants and coefficients in Kontsevich integral in a combinatorial way…

The $n$-loop Kontsevich invariant of knots takes its value in the completion of the space of $n$-loop open Jacobi diagrams, which is an infinite dimensional vector space. Since the 1-loop part is presented by the Alexander polynomial, we…

Introducing a way to modify knots using $n$-trivial rational tangles, we show that knots with given values of Vassiliev invariants of bounded degree can have arbitrary unknotting number (extending a recent result of Ohyama, Taniyama and…

We show that two knots have matching Vassiliev invariants of order less than n if and only if they are equivalent modulo the nth group of the lower central series of some pure braid group, thus characterizing Vassiliev's knot invariants in…

To each ribbon graph we assign a so-called L-space, which is a Lagrangian subspace in an even-dimensional vector space with the standard symplectic form. This invariant generalizes the notion of the intersection matrix of a chord diagram.…

We determine the number of nonequivalent chord diagrams of order $n$ under the action of two groups, $C_{2n}$, a cyclic group of order $2n$, and $D_{2n}$, a dihedral group of order $4n$. Asymptotic formulas are also established.

We show how to define invariants of graphs related to quantum $\mathfrak{sl}(2)$ when the graph has more then one connected component and components are colored by blocks of representations with zero quantum dimensions.

We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…

We study the unwheeled rational Kontsevich integral of torus knots. We give a precise formula for these invariants up to loop degree 3 and show that they appear as colorings of simple diagrams. We show that they behave under cyclic branched…

Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…

The intersection graph of a family of sets $\{S_{1},S_{2},\ldots,S_{n}\}$ is a graph whose vertex set is $\{S_{1},S_{2},\ldots,S_{n}\}$ and two distinct vertices are adjacent if the intersection of the corresponding sets is non-empty.…

We construct gauge invariant operators for singular knots in the context of Chern-Simons gauge theory. These new operators provide polynomial invariants and Vassiliev invariants for singular knots. As an application we present the form of…

We use grid diagrams to present a unified picture of braids, Legendrian knots, and transverse knots.

The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. Using binary indexed tree data structure, we improve algorithms for calculating the size and the number of…