English
Related papers

Related papers: Identification of 2-bridge links

200 papers

Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set of objects is visualized as a set of vertices (points) on…

Computational Geometry · Computer Science 2022-08-30 Reyan Ahmed , Stephen Kobourov , Myroslav Kryven

The quandle coloring quiver was introduced by Cho and Nelson as a categorification of the quandle coloring number. In some cases, it has been shown that the quiver invariant offers more information than other quandle enhancements. In this…

Quantum Algebra · Mathematics 2023-07-11 Tirasan Khandhawit , Korn Kruaykitanon , Puttipong Pongtanapaisan

We introduce the triple crossing number, a variation of crossing number, of a graph, which is the minimal number of crossing points in all drawings with only triple crossings of the graph. It is defined to be zero for a planar graph, and to…

Combinatorics · Mathematics 2012-01-16 Hiroyuki Tanaka , Masakazu Teragaito

We describe a way of encoding a Kauffman state as a set of tuples, similar to a Gauss code. Then we describe a procedure for using these state codes to determine the unoriented genus and crosscap number of any prime alternating knot or…

Geometric Topology · Mathematics 2025-12-11 Isaias Bahena , Thomas Kindred , Jason Parsley

Riley "defined" the Heckoid groups for 2-bridge links as Kleinian groups, with nontrivial torsion, generated by two parabolic transformations, and he constructed an infinite family of epimorphisms from 2-bridge link groups onto Heckoid…

Geometric Topology · Mathematics 2012-10-29 Donghi Lee , Makoto Sakuma

We show that the average or expected absolute value of the signatures of all 2-bridge knots with crossing number $c$ approaches $\sqrt{{2c}/{\pi}}$. Baader, Kjuchukova, Lewark, Misev, and Ray consider a model for 2-bridge knot diagrams…

Geometric Topology · Mathematics 2024-06-26 Moshe Cohen , Adam M. Lowrance , Neal Madras , Steven Raanes

We use the degree of the colored Jones knot polynomials to show that the crossing number of a $(p,q)$-cable of an adequate knot with crossing number $c$ is larger than $q^2\, c$. As an application we determine the crossing number of…

Geometric Topology · Mathematics 2025-05-05 Efstratia Kalfagianni , Rob Mcconkey

We use twisted Alexander polynomials to show that certain algebraically slice 2-bridge knots are not topologically slice, even though all prime power Casson-Gordon signatures vanish. We also provide some computations indicating the efficacy…

Geometric Topology · Mathematics 2015-07-08 Allison N. Miller

We discuss the relation between arc index, maximal Thurston--Bennequin number, and Khovanov homology for knots. As a consequence, we calculate the arc index and maximal Thurston--Bennequin number for all knots with at most 11 crossings. For…

Geometric Topology · Mathematics 2013-10-09 Lenhard Ng

We give a list of minimal grid diagrams of the 13 crossing prime nonalternating knots which have arc index 13. There are 9,988 prime knots with crossing number 13. Among them 4,878 are alternating and have arc index 15. Among the other…

Geometric Topology · Mathematics 2024-02-06 Hwa Jeong Lee , Yoonsang Lee , Chanmin Lee , Yeseo Park , Hun Kim , Gyo Taek Jin

We introduce and study knots and links in 2-dimensional complexes. In particular, we define linking numbers for oriented two-component links in 2-complexes and a Kauffman-type bracket polynomial for links in 2-complexes. We also discuss…

Geometric Topology · Mathematics 2023-06-13 Vladimir Turaev

We propose a method to compute complex volume of 2-bridge link complements. Our construction sheds light on a relationship between cluster variables with coefficients and canonical decompositions of link complements.

Geometric Topology · Mathematics 2014-11-19 Kazuhiro Hikami , Rei Inoue

A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that…

Physics and Society · Physics 2018-01-24 Ang-Kun Wu , Liang Tian , Yang-Yu Liu

For any link in the 3-sphere, there is a natural lower bound for the unlinking number in terms of the classical signature. We prove that if this lower bound is sharp for a special alternating link $L$, then the unlinking number of $L$ is…

Geometric Topology · Mathematics 2026-03-25 Duncan McCoy , JungHwan Park

In links with two components there are three different types of crossings: self-crossings in the first component, self crossings in the second component, and crossings between components. In this paper we examine the minimum number of…

Geometric Topology · Mathematics 2020-05-26 Natalie DuBois , Chris Eufemia , Jeff Johannes , Jenna Zomback

In this paper, we propose a subnetwork decomposition/combination approach to investigate the single rate $2$-pair unicast problem. It is shown that the solvability of a $2$-pair unicast problem is completely determined by four specific link…

Information Theory · Computer Science 2010-07-06 K. Cai , K. B. Letaief , P. Fan , R. Feng

For an oriented surface link $S$, we can take a satellite construction called a 2-dimensional braid over $S$, which is a surface link in the form of a covering over $S$. We demonstrate that 2-dimensional braids over surface links are useful…

Geometric Topology · Mathematics 2015-10-19 Inasa Nakamura

By examining knot Floer homology, we extend a result of Ozsv\'ath and Stipsicz and show further infinitely many Legendrian and transversely non-simple knot types among two-bridge knots. We give sufficient conditions of Legendrian and…

Symplectic Geometry · Mathematics 2020-04-03 Viktória Földvári

Bundling crossings is a strategy which can enhance the readability of drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main…

Computational Geometry · Computer Science 2021-10-01 Alan Arroyo , Stefan Felsner

The 2-switch-degree of $G$ is the number of distinct 2-switches acting on a graph $G$. In this work we study structural properties of the 2-switch-degree, with a focus on split graphs. Our approach is motivated by the Tyshkevich…

Combinatorics · Mathematics 2025-09-23 Victor Nicolas Schvöllner