Abstract <p> The Goeritz matrix is an alternative to the Kauffman bracket and, in addition, makes it possible to calculate the Jones polynomial faster with some minimal choice of a checkerboard surface of a link diagram. We introduce a modification of the Goeritz method that generalizes the Goeritz matrix for computing the HOMFLY–PT polynomials for any <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(N\)</EquationSource> </InlineEquation> in the special case of bipartite links. Our method reduces to purely algebraic operations on matrices, and therefore, it can easily be implemented as a computer program. Bipartite links form a rather large family, including a special class of Montesinos links constructed from the so-called rational tangles. We demonstrate how to obtain a bipartite diagram of such links and calculate the corresponding HOMFLY–PT polynomials using our developed generalized Goeritz method. </p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Analogue of Goeritz matrices for computation of bipartite HOMFLY–PT polynomials

  • A. S. Anokhina,
  • D. V. Korzun,
  • E. N. Lanina,
  • A. Yu. Morozov

摘要

Abstract

The Goeritz matrix is an alternative to the Kauffman bracket and, in addition, makes it possible to calculate the Jones polynomial faster with some minimal choice of a checkerboard surface of a link diagram. We introduce a modification of the Goeritz method that generalizes the Goeritz matrix for computing the HOMFLY–PT polynomials for any \(N\) in the special case of bipartite links. Our method reduces to purely algebraic operations on matrices, and therefore, it can easily be implemented as a computer program. Bipartite links form a rather large family, including a special class of Montesinos links constructed from the so-called rational tangles. We demonstrate how to obtain a bipartite diagram of such links and calculate the corresponding HOMFLY–PT polynomials using our developed generalized Goeritz method.