相关论文: Petal Projections, Knot Colorings and Determinants

Introduced recently, an n-crossing is a singular point in a projection of a link at which n strands cross such that each strand travels straight through the crossing. We introduce the notion of an \"ubercrossing projection, a knot…

An $n$-crossing is a point in the projection of a knot where $n$ strands cross so that each strand bisects the crossing. An \"ubercrossing projection has a single $n$-crossing and a petal projection has a single $n$-crossing such that there…

A petal projection of a knot $K$ is a projection of a knot which consists of a single multi-crossing and non-nested loops. Since a petal projection gives a sequence of natural numbers for a given knot, the petal projection is a useful model…

It was shown in arXiv:1208.5742 that any smooth knot can be represented by an \"ubercrossing projection, i.e. a knot projection with no crossings aside from a single multi-crossing. We extend this idea to Legendrian knots and investigate…

Pseudodiagrams are diagrams of knots where some information about which strand goes over/under at certain crossings may be missing. Pseudoknots are equivalence classes of pseudodiagrams, with equivalence defined by a class of…

The representation of knots by petal diagrams (Adams et al. 2012) naturally defines a sequence of distributions on the set of knots. In this article we establish some basic properties of this randomized knot model. We prove that in the…

We introduce an unknotting-type number of knot projections that gives an upper bound of the crosscap number of knots. We determine the set of knot projections with the unknotting-type number at most two, and this result implies classical…

We extend the concepts of trivializing and knotting numbers for knots to spatial graphs and 2-bouquet graphs, in particular. Furthermore, we calculate the trivializing and knotting numbers for projections and pseudodiagrams of 2-bouquet…

We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability.…

A quadruple crossing is a crossing in a projection of a knot or link that has four strands of the knot passing straight through it. A quadruple crossing projection is a projection such that all of the crossings are quadruple crossings. In a…

We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group $S_{2n+1}$. We define two classes of moves on such permutations, called trivial petal additions and crossing…

In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the…

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…

The warping degree of an oriented knot diagram is the minimal number of crossings which we meet as an under-crossing first when we travel along the diagram from a fixed point. The warping degree of a knot projection is the minimal value of…

Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…

The warping matrix has been defined for knot projections and knot diagrams by using warping degrees. In particular, the warping matrix of a knot diagram represents the knot diagram uniquely. In this paper we show that the rank of the…

Multicrossings, which have previously been defined for classical knots and links, are extended to virtual knots and links. In particular, petal diagrams are shown to exist for all virtual knots.

Every knot has a plat projection, obtained by closing up a braid with bridges. The plat projection is determined by the number of strands and the number of rows of twist regions in the braid, and an integer number of crossings in each twist…

We determine p-colorability of the paradromic rings. These rings arise by generalizing the well-known experiment of bisecting a Mobius strip. Instead of joining the ends with a single half twist, use $m$ twists, and, rather than bisecting…

It is known that each knot has a semimeander diagram (i. e. a diagram composed of two smooth simple arcs), however the number of crossings in such a diagram can only be roughly estimated. In the present paper we provide a new estimate of…