Computer evaluation of Kauffman polynomials by using Gauss codes, with a skein-template algorithm
From MaRDI portal
Publication:1855027
DOI10.1016/S0096-3003(00)00030-8zbMath1026.57011OpenAlexW2024768332WikidataQ128123417 ScholiaQ128123417MaRDI QIDQ1855027
S. Meunier-Guttin-Cluzel, Gérard Gouesbet
Publication date: 28 January 2003
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0096-3003(00)00030-8
Related Items
Analysis of trapped entanglements in polymer networks. ⋮ Hyperbolicity and abundance of elliptical islands in annular billiards ⋮ On the calculation of the Kauffman bracket polynomial
Cites Work
- State models for link polynomials
- Construction of phenomenological models from numerical scalar time series
- A polynomial invariant for unoriented knots and links
- Kauffman's polynomial and alternating links
- Computing Vassiliev's invariants
- Knotted periodic orbits in dynamical systems. I: Lorenz's equations
- Knot polynomials and Vassiliev's invariants
- TOPOLOGICAL ANALYSIS OF CHAOS IN EQUIVARIANT ELECTRONIC CIRCUITS
- On Knots. (AM-115)
- GAUSS CODES, QUANTUM GROUPS AND RIBBON HOPF ALGEBRAS
- Chaos in variable stars: Topological analysis of W Vir model pulsations
- An Invariant of Regular Isotopy
- Polynomials for Links
- Unnamed Item
- Unnamed Item
This page was built for publication: Computer evaluation of Kauffman polynomials by using Gauss codes, with a skein-template algorithm