中文
相关论文

相关论文: The almost alternating diagrams of the trivial kno…

200 篇论文

If a knot has the Alexander polynomial not equal to 1, then it is linear $n$-colorable. By means of such a coloring, such a knot is given an upper bound for the minimal quandle order, i.e., the minimal order of a quandle with which the knot…

几何拓扑 · 数学 2012-02-29 Chuichiro Hayashi , Miwa Hayashi , Kanako Oshiro

We enumerate the state diagrams of the twist knot shadow which consist of the disjoint union of two trivial knots. The result coincides with the maximal number of regions into which the plane is divided by a given number of circles. We then…

组合数学 · 数学 2017-12-19 Franck Ramaharo

There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, there is a sequence of at most $2^{c_1 n}$ Reidemeister moves that will convert it to a trivial knot diagram, $n$ is the number of crossings in $D$. A…

几何拓扑 · 数学 2007-05-23 Joel Hass , Jeffrey C. Lagarias

Pseudodiagrams are knot or link diagrams where some of the crossing information is missing. Pseudoknots are equivalence classes of pseudodiagrams, where equivalence is generated by a natural set of Reidemeister moves. In this paper, we…

几何拓扑 · 数学 2013-11-15 Francois Dorais , Allison Henrich , Slavik Jablan , Inga Johnson

We introduce a new numerical invariant for special, reduced, alternating diagrams of oriented knots and links, defined in terms of the Laplacian matrix of the associated Tait graph. For a special alternating diagram, the Laplacian encodes…

几何拓扑 · 数学 2026-02-13 Michal Jablonowski

Unknotting numbers for torus knots and links are well known. In this paper, we present a method for determining the position of unknotting number crossing changes in a toric braid B(p, q) such that the closure of the resultant braid is…

几何拓扑 · 数学 2012-07-23 Vikash Siwach , Madeti Prabhakar

A crossing in a knot is nugatory if changing the crossing does not change the knot type. Using an invariant of certain types of closed 3-braid diagrams, we show that if a closed 3-braid contains a nugatory crossing then its braid index is…

几何拓扑 · 数学 2010-01-12 Chad Wiley

We prove that parities on virtual knots come from invariant 1-cycles on the arcs of knot diagrams. In turn, the invariant cycles are determined by quasi-indices on the crossings of the diagrams. The found connection between the parities and…

几何拓扑 · 数学 2021-10-19 Igor Nikonov

Knot diagrams are among the most common visual tools in topology. Computer programs now make it possible to draw, manipulate and render them digitally, which proves to be useful in knot theory teaching and research. Still, an openly…

人机交互 · 计算机科学 2024-08-06 Lennart Finke , Edmund Weitz

We investigate Feynman diagrams which are calculable in terms of generalized one-loop functions, and explore how the presence or absence of transcendentals in their counterterms reflects the entanglement of link diagram constructed from…

高能物理 - 理论 · 物理学 2011-09-13 Dirk Kreimer

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…

几何拓扑 · 数学 2007-05-23 Lisa Hernandez , Xiao-Song Lin

Let $D$ be a diagram of an alternating knot with unknotting number one. The branched double cover of $S^3$ branched over $D$ is an L-space obtained by half integral surgery on a knot $K_D$. We denote the set of all such knots $K_D$ by…

几何拓扑 · 数学 2021-11-01 Andrew Donald , Duncan McCoy , Faramarz Vafaee

Given any oriented link diagram, two types of new knot invariants are constructed. They satisfy some generalized skein relations. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations of those…

几何拓扑 · 数学 2011-05-10 Zhiqing Yang

In this paper, we show that it is NP-hard to determine whether a given graph admits a min-1-planar drawing. A drawing of a graph is min-$k$-planar if, for every crossing in the drawing, at least one of the two crossing edges involves at…

计算几何 · 计算机科学 2026-05-25 Yuto Okada

We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…

几何拓扑 · 数学 2007-05-23 Thomas W. Mattman , Ryan Ottman , Matt Rodrigues

We study alternating strand diagrams on the disk with an orbifold point. These are quotients by rotation of Postnikov diagrams on the disk, and we call them orbifold diagrams. We associate a quiver with potential to each orbifold diagram,…

表示论 · 数学 2023-02-07 Karin Baur , Andrea Pasquali , Diego Velasco

Let K be a an alternating prime knot in the 3-sphere. We investigate the category of flypes between reduced alternating diagrams for K. As a consequence, we show that any odd prime order action on K is isotopic through maps of pairs to a…

几何拓扑 · 数学 2019-06-12 Keegan Boyle

In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As…

几何拓扑 · 数学 2017-03-20 Zhiqing Yang

We prove that any $11$-colorable knot is presented by an $11$-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially $11$-colored diagrams of the knot. We also…

几何拓扑 · 数学 2015-05-13 Takuji Nakamura , Yasutaka Nakanishi , Shin Satoh

We prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (236 c)^{11} Reidemeister moves. Moreover, every diagram in this sequence has at most (7 c)^2 crossings. We also prove a similar…

几何拓扑 · 数学 2014-12-12 Marc Lackenby
‹ 上一页 1 8 9 10 下一页 ›