Abstract
This paper discusses a question in complexity of untanglement of graph embeddings in relation to the well-known Chinese Rings puzzle. A series of examples is described in which the complexity of untanglement is conjectured to rise exponentially as a function of the structural complexity of the associated graphs. Possible relations with biological and physical systems are discussed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E.N. Gilbert, “Gray codes and paths on the n-cube”, The Bell System Technical Journal, May 1958, p. 815–826.
F. Gray, “Pulse code communication”, U.S. Patent 2.632.058.
L.H. Kauffman, “Knot Logic”, in Knots and Applications, edited by L.H. Kauffman, World Scientific Pub. Co., Singapore, 1995.
A. MacArthur, “The entanglement structures of polymers”, in Knots and Applications, edited by L.H. Kauffman, World Scientific Pub. Co., Singapore, 1995.
W.W. Rouse Ball and H.S.M. Coxeter, Mathematical Recreations and Essays, University of Toronto Press, Toronto, 1974 (first edition - 1894).
J. Slocum and J. Botemans, Puzzles Old and New — How to Make and Solve Them, University of Washington Press, Seattle, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Kauffman, L.H. (1996). Tangle Complexity and the Topology of the Chinese Rings. In: Mesirov, J.P., Schulten, K., Sumners, D.W. (eds) Mathematical Approaches to Biomolecular Structure and Dynamics. The IMA Volumes in Mathematics and its Applications, vol 82. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4066-2_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4066-2_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-94838-6
Online ISBN: 978-1-4612-4066-2
eBook Packages: Springer Book Archive