오승상 교수

Knot mosaic theory was introduced by Lomonaco and Kauffman in the paper on ‘Quantum knots and mosaics’ to give a precise and workable definition of quantum knots, intended to represent an actual physical quantum system. A knot [Formula: see text]-mosaic is an [Formula: see text] matrix whose entries are eleven mosaic tiles, representing a knot or a link by adjoining properly. In this paper, we introduce two variants of knot mosaics: period knot mosaics and toroidal knot mosaics, which are common

Knots and links have been considered to be useful models for structural analysis of molecular chains such as DNA and proteins. One quantity that we are interested on molecular links is the minimum number of monomers necessary to realize them. In this paper we consider every link in the cubic lattice. Lattice stick number $s_L(L)$ of a link $L$ is defined to be the minimal number of sticks required to construct a polygonal representation of the link in the cubic lattice. Huh and Oh found all knot

Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper M"> <mml:semantics> <mml:mi>M</mml:mi> <mml:annotation encoding="application/x-tex">M</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be a compact, connected, orientable, irreducible 3-manifold whose boundary is a torus. We announce that if two Dehn fillings create reducible manifold and manifold containing Klein bottle, then the maximal distance is three.

Abstract A graph is intrinsically knotted if every embedding contains a nontrivially knotted cycle. It is known that intrinsically knotted graphs have at least 21 edges and that the KS graphs, K 7 and the 13 graphs obtained from K 7 by moves, are the only minor minimal intrinsically knotted graphs with 21 edges [1, 9, 11, 12]. This set includes exactly one bipartite graph, the Heawood graph. In this article we classify the intrinsically knotted bipartite graphs with at most 22 edges. Previously

Since the Jones polynomial was discovered, the connection between knot theory and quantum physics has been of great interest. Lomonaco and Kauffman introduced the knot mosaic system to give a definition of the quantum knot system that is intended to represent an actual physical quantum system. Recently the authors developed an algorithm producing the exact enumeration of knot mosaics, which uses a recursion formula of state matrices. As a sequel to this research program, we similarly define the

Abstract In this paper we investigate a ropelength-minimizing conformation of 4-strand superhelical strings whose axial curves constitute the standard double helix. In Huh et al (2016 J. Phys. A: Math. Theor . 49 415205) the authors found a specific conformation of standard double helix which was mathematically shown to be the unique ropelength-minimizing conformation. Adopting the conformation as axial curves we present a parametrization of superhelical curves so that the resulting shape is con

For a certain infinite family of knots or links, we study the growth power ratios of their stick number, lattice stick number, minimum lattice length and minimum ropelength compared with their minimum crossing number c(K) for every . It is known that the stick number and lattice stick number grow between the and linear power of the crossing number, and minimum lattice length and minimum ropelength grow with at least the power of crossing number (which is called the four-thirds power law). Furthe

Abstract We present here infinitely many planar graphs which have no strongly almost trivial embeddings. Then we conclude that “ strongly almost trivial ” is more strict concept than “ almost trivial. ”. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 319–326, 2003

For a nontrivial knot [Formula: see text], Negami found an upper bound on the stick number [Formula: see text] in terms of its crossing number [Formula: see text] which is [Formula: see text]. Later, Huh and Oh utilized the arc index [Formula: see text] to present a more precise upper bound [Formula: see text]. Furthermore, Kim, No and Oh found an upper bound on the equilateral stick number [Formula: see text] as follows; [Formula: see text]. As a sequel to this research program, we similarly de

In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index [Formula: see text] and arc index [Formula: see text] for any knot or non-split link [Formula: see text], which are [Formula: see text] and [Formula: see text]. We also find a quadratic upper bound of the minimal crossing number of delta diagrams of [Formula: see text].

In this paper we prove the unique existence of a ropelength-minimizing conformation of the θ-spun double helix in a mathematically rigorous way, and find the minimal ropelength where t is the unique solution in of the equation . Using this result, the pitch angles of the standard, triple and quadruple helices are around , and , respectively, which are almost identical with the approximated pitch angles of the zero-twist structures previously known by Olsen and Bohr. We also find the ropelength o