Skip to main content
Log in

Coding of Knots by T-Graphs

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

In this paper, knots are considered as smooth embeddings of a circle into ℝ3 defined by their flat diagrams. We propose a new method of coding knots by T-graphs describing the torsion structure on a flat diagram. For this method of coding, we introduce conceptions of a cycle and a block and describe transformations of T-graphs under the first and the third Reidemeister moves applied to the flat diagram of a knot.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. O. N. Biryukov, “Ridgeless knots,” Vestn. Gos. Sots.-Gum. Un-ta, No. 3 (35), 18–23 (2019).

  2. R. Crowell and R. Fox, Introduction to Knot Theory [in Russian], Mir, Moscow (1967).

  3. S. V. Duzhin and S. V. Chmutov, “Knots and their invariants,” In: Mathematical Enlightenment, Vol. 3, MTsNMO, Moscow, pp. 59–93 (1999).

  4. I. A. Dynnikov, “Recognition algorithms in knot theory,” Usp. Mat. Nauk, 58, No. 6, 45–92 (2003).

    MathSciNet  MATH  Google Scholar 

  5. J. Hass, “Algorithms for recognizing knots and 3-manifolds,” Chaos Solitons Fractals, 9, No. 4-5, 569–581 (1998).

    Article  MathSciNet  MATH  Google Scholar 

  6. V. O. Manturov, Knot Theory [in Russian], NITs Reg. Khaot. Dinam., Moscow–Izhevsk (2005).

  7. A. B. Sosinskiy, Nodes. Timeline of One Mathematical Theory [in Russian], MTsNMO, Moscow (2005).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to O. N. Biryukov.

Additional information

Translated from Sovremennaya Matematika. Fundamental’nye Napravleniya (Contemporary Mathematics. Fundamental Directions), Vol. 66, No. 4, Algebra, Geometry, and Topology, 2020.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Biryukov, O.N. Coding of Knots by T-Graphs. J Math Sci 267, 529–540 (2022). https://doi.org/10.1007/s10958-022-06159-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-022-06159-2

Navigation