Informazione, complessità e caos debole nei sistemi dinamici; teoria e metodi di misura
On a problem in effective knot theory
The following problem is investigated: «Find an elementary function such that if is a knot diagram with crossings and the corresponding knot is trivial, then there is a sequence of Reidemeister moves that proves triviality such that at each step we have less than crossings». The problem is shown to be equivalent to a problem posed by D. Welsh in [7] and solved by geometrical techniques (normal surfaces).
Page 1