Abstract
We address here the topological equivalence of knots through the so-called Reidemeister moves. These topology-conserving manipulations are recast into dynamical rules on the crossings of knot diagrams. This is presented in terms of a simple graphical representation related to the Gauss code of knots. Drawing on techniques for reaction-diffusion systems, we then develop didactically an operator formalism wherein these rules for crossing dynamics are encoded. {The aim is to develop new tools for studying dynamical behaviour and regimes in the presence of topology conservation}. This necessitates the introduction of composite paulionic operators. The formalism is applied to calculate some differential equations for {the time evolution} of densities and correlators of crossings, subject to topology-conserving stochastic dynamics. {We consider here the simplified situation of two-dimensional knot projections. However, we hope that this is a first valuable step towards} addressing a number of important questions regarding the role of topological constraints {and specifically of topology conservation} in dynamics through a variety of solution and approximation schemes. Further applicability arises in the context of the simulated annealing of knots. The methods presented here depart significantly from the invariant-based path integral descriptions often applied in polymer systems, {and, in our view, offer a fresh perspective on} the conservation of topological states and topological equivalence in knots.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.