Abstract
AbstractWe present some recent results concerning the structure of renormalizable Lorenz links. Then we use these results to derive formulae for the computation of knot and link invariants. Finally we analyze the complexity of the algorithms obtained and compare it with the complexity of the algorithms derived from the definitions, obtaining a reduction from exponential complexity, in the classic algorithms, to linear in our algorithms.KeywordsStar ProductPeriodic SequenceAdmissible PairLorenz AttractorLink InvariantThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
