相关论文: On annulus presentations, dualizable patterns and …

A knot is a circle embedded in the space. Projecting a knot on a plane, we obtain a diagram which is known as the knot diagram. The vertices of the diagram, where the curved lines are crossed, can be considered as sites occupied by…

Motivated by the question of finding a type B analogue of the bijection between oscillating tableaux and matchings, we find a correspondence between oscillating m-rim hook tableaux and m-colored matchings, where m is a positive integer. An…

In this paper we establish a connection between ribbon graphs and Brauer graphs. As a result, we show that a compact oriented surface with marked points gives rise to a unique Brauer graph algebra up to derived equivalence. In the case of a…

In an earlier paper, we introduced ``bordered knot algebras'', which are graded algebras indexed by a pair of integers (m,k). In a subsequent paper, we introduced a two-parameter family of differential graded algebra, the ``pong algebras'',…

Given a group endowed with a Z/2-valued morphism we associate a Gauss diagram theory, and show that for a particular choice of the group these diagrams encode faithfully virtual knots on a given arbitrary surface. This theory contains all…

A string figure is topologically a trivial knot lying on an imaginary plane orthogonal to the fingers with some crossings. The fingers prevent cancellation of these crossings. As a mathematical model of string figure we consider a knot…

A knot theory for two-dimensional square lattice is proposed, which sheds light on design of new two-dimensional material with high topological numbers. We consider a two-band model, focusing on the Hall conductance {\sigma}xy = e^2/hbar*P,…

An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in…

Closed 3-string braids admit many bandings to two-bridge links. By way of the Montesinos Trick, this allows us to construct infinite families of knots in the connected sum of lens spaces L(r,1) # L(s,1) that admit a surgery to a lens space…

In this paper we study some consequences of the author's classification of graph manifolds by their profinite fundamental groups. In particular we study commensurability, the behaviour of knots, and relation to mapping classes. We prove…

The unknotting number $u$ and the genus $g$ of braid positive knots are equal, as shown by Rudolph. We prove the stronger statement that any positive braid diagram of a genus $g$ knot contains $g$ crossings, such that changing them produces…

A companion paper to "On knot Floer homology in branched double covers" applied to braided branched loci. We reprove the main result of that paper concerning alternating branched loci when projected to an annulus, without using Khovanov…

This paper provides the complete table of prime knot projections with their mirror images, without redundancy, up to eight double points systematically thorough a finite procedure by flypes. In this paper, we show how to tabulate the knot…

The zero modes of closed strings on a torus --the torus coordinates plus dual coordinates conjugate to winding number-- parameterize a doubled torus. In closed string field theory, the string field depends on all zero-modes and so can be…

In this paper we discuss the applications of knotoids to modelling knots in open curves and produce new knotoid invariants. We show how invariants of knotoids generally give rise to well-behaved measures of how much an open curve is…

An edge-colored graph $G$ is rainbow connected if every pair of vertices of $G$ are connected by a path whose edges have distinct colors. The rainbow connection number $rc(G)$ of $G$ is defined to be the minimum integer $t$ such that there…

A representation for compact 3-manifolds with non-empty non-spherical boundary via 4-colored graphs (i.e., 4-regular graphs endowed with a proper edge-coloration with four colors) has been recently introduced by two of the authors, and an…

A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…

Brane tilings, sometimes called dimer models, are a class of bipartite graphs on a torus which encode the gauge theory data of four-dimensional SCFTs dual to D3-branes probing toric Calabi--Yau threefolds. An efficient way of encoding this…

Let $K$ be a knot type for which the quadratic term of the Conway polynomial is nontrivial, and let $\gamma: \mathbb{R}\to \mathbb{R}^3$ be an analytic $\mathbb{Z}$-periodic function with non-vanishing derivative which parameterizes a knot…