Related papers: Diagram genus, generators and applications

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…

In this paper, we derive nearly tight probabilistic norm bounds for a class of random matrices we call graph matrices. While the classical case of symmetric matrices with independent random entries (Wigner's matrices) is a special case, in…

We study the band-unknotting number $u_{nb}(K)$ of a knot $K$, and how it behaves with respect to connect sums. We show that this sub-additive function is not additive under connected sums, by finding infinitely many examples of knots $K_1,…

For certain classes of knots we define geometric invariants called higher-order genera. Each of these invariants is a refinement of the slice genus of a knot. We find lower bounds for the higher-order genera in terms of certain von Neumann…

It has long been known that the quadratic term in the degree of the colored Jones polynomial of a knot is bounded above in terms of the crossing number of the knot. We show that this bound is sharp if and only if the knot is adequate. As an…

The doubly slice genus of a knot in the 3-sphere is the minimal genus among unknotted orientable surfaces in the 4-sphere for which the knot arises as a cross-section. We use the classical signature function of the knot to give a new lower…

We develop a purely combinatorial framework for the systematic enumeration of knot and link diagrams supported on the thickened torus $T^2\times I$. Using the theory of maps on surfaces, cellular $4$--regular torus projections are encoded…

We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1…

We study cosmetic crossings in knots of genus one and obtain obstructions to such crossings in terms of knot invariants determined by Seifert matrices. In particular, we prove that for genus one knots the Alexander polynomial and the…

Let $D$ be a knot diagram, and let ${\mathcal D}$ denote the set of diagrams that can be obtained from $D$ by crossing exchanges. If $D$ has $n$ crossings, then ${\mathcal D}$ consists of $2^n$ diagrams. A folklore argument shows that at…

Topological gauge theories in four dimensions which admit surface operators provide a natural framework for realizing homological knot invariants. Every such theory leads to an action of the braid group on branes on the corresponding moduli…

An U(N)-invariant matrix model with d matrix variables is studied. It was shown that in the limit $N\to \infty $ and $d\to 0$ the model describes the knot diagrams. We realize the free partition function of the matrix model as the…

We define a metric filtration of the Gordian graph by an infinite family of 1-dense subgraphs. The n-th subgraph of this family is generated by all knots whose fundamental groups surject to a symmetric group with parameter at least n, where…

This work is dedicated to the consideration of the construction of a representation of braid group generators from vertex models with $N$-states, which provides a great way to study the knot invariant. An algebraic formula is proposed for…

We give generators and relations for the planar algebras corresponding to $ADE$ subfactors. We also give a basis and an algorithm to express an arbitrary diagram as a linear combination of these basis diagrams.

We classify 3-braid knots whose topological 4-genus coincides with their Seifert genus, using McCoy's twisting method and the Xu normal form. In addition, we give upper bounds for the topological 4-genus of positive and strongly…

We compose the table of knots in the thickened torus T x I having diagrams with at most 4 crossings. The knots are constructed by the three-step process. First we list regular graphs of degree 4 with at most 4 vertices, then for each graph…

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram…

The colored Jones function of a knot is a sequence of Laurent polynomials in one variable, whose n-th term is the Jones polynomial of the knot colored with the n-dimensional irreducible representation of SL(2). It was recently shown by TTQ…