Twisting, ladder graphs, and A-polynomials (Q6163770)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7704874
Language Label Description Also known as
default for all languages
No label defined
    English
    Twisting, ladder graphs, and A-polynomials
    scientific article; zbMATH DE number 7704874

      Statements

      Twisting, ladder graphs, and A-polynomials (English)
      0 references
      0 references
      30 June 2023
      0 references
      The A-polynomial was defined by \textit{D. Cooper} et al. [Invent. Math. 118, No. 1, 47--84 (1994; Zbl 0842.57013)]. The A-polynomial is a very powerful 2-variable polynomial invariant of knots which detects (most) boundary slopes of incompressible surfaces in the knot complement and which is conjecturally related to the colored Jones polynomial (via the AJ conjecture of \textit{S. Garoufalidis} [Geom. Topol. Monogr. 7, 291--309 (2004; Zbl 1080.57014)]). The polynomial is difficult to compute; full computations have been done only for knots with small crossing numbers and for some infinite families with manageable fundamental groups. In recent work by \textit{J. A. Howie} [``A-polynomials, Ptolemy equations and Dehn filling'', Preprint, \url{arXiv:2002.10356}], the authors relate the computations for A-polynomials to the exchange relations of cluster algebras, using this to simplify calculations of A-polynomials for knots related by twisting. In the paper reviewed here, the author exploits this relationship further to extend the results of Howie, Matthews, and Purcell [\textit{J. A. Howie} et al., ``A-polynomials, Ptolemy equations and Dehn filling'', Preprint, \url{arXiv:2002.10356}], leading to new results related to cluster algebras and computations of A-polynomials for a family of twisted torus knots.
      0 references
      Dehn filling
      0 references
      layered solid torus
      0 references
      A-polynomial
      0 references
      cluster algebras
      0 references
      perfect matchings
      0 references
      ladder graphs
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references