Physicists Tackle Knotty Puzzle

December 2007
Science & Children;Dec2007, Vol. 45 Issue 4, p10
Academic Journal
The article focuses on the study which examines the likelihood of knot formation and the types of knots formed in a tumbled string. Researchers explain that they are interested in the problem because of its usefulness in various applications. Douglas Smith, senior author of the research, explains that knot formation is important in many fields. Specifically, he cites that knots often form in DNA. Meanwhile, research assistant Dorian Raymer discloses that he initiated the study because of his interest in knot theory, a branch of mathematics that uses formulae to distinguish unique knots.


Related Articles

  • Pieces of tumbled string form topologically simple and complex knots. Day, Charles // Physics Today;Nov2007, Vol. 60 Issue 11, p19 

    The article discusses how knot experiments demonstrate knot theory. Biophysicist Douglas Smith and undergraduate student Dorian Raymer used a piece of string to measure knot probability and forms of knots. A computer program analyzed the knots to present knot topology known as the Jones...

  • Genome-Wide Identification of Human Functional DNA Using a Neutral Indel Model. Lunter, Gerton; Ponting, Chris P.; Hein, Jotun // PLoS Computational Biology;Jan2006, Vol. 2 Issue 1, pe5 

    It has become clear that a large proportion of functional DNA in the human genome does not code for protein. Identification of this non-coding functional sequence using comparative approaches is proving difficult and has previously been thought to require deep sequencing of multiple...

  • Why headphone leads get in a tangle.  // New Scientist;9/29/2007, Vol. 195 Issue 2623, p17 

    The article reports on a study by researchers Dorian Raymer and Douglas Smith of the University of California, which investigated the tendency of strings to become knotted when tumbled inside a container. It was determined that strings longer than one and a half meters formed knots approximately...

  • An effective evolutionary algorithm for the practical capacitated vehicle routing problems. Wang, Chung-Ho; Lu, Jiu-Zhang // Journal of Intelligent Manufacturing;Aug2010, Vol. 21 Issue 4, p363 

    The evolutionary algorithms are extensively adopted to resolve complex optimization problem. Genetic algorithm (GA), an evolutionary algorithm, has been proved capable of solving vehicle routing problems (VRPs). However, the resolution effectiveness of GA decreases with the increase of nodes...

  • DNA COMPRESSED AND SEQUENCE SEARCHING ON MULTICORE. SOEWITO, BENFANO // International Journal of Engineering Science & Technology;Jun2012, Vol. 4 Issue 6, p2918 

    One of the used of string matching is to search DNA sequence in the DNA database. This simple operation can be done in hours or days, because the huge size of DNA sequence database. On the other hand, the potential of multicore for DNA sequence searching is not fully explored due to the...

  • KNOTS, UNRAVELED. Glausiusz, Josie // Discover;Feb2008, Vol. 29 Issue 2, p16 

    The article reports on mathematical knot theories developed by physicists Doug Smith and Dorian Raymer of the University of California at San Diego who attempted to study knot formation by wrapping strings around a box. Smith feels that their research could explain how umbilical cords tangle or...

  • ESSENTIAL STATE SURFACES FOR KNOTS AND LINKS. OZAWA, MAKOTO // Journal of the Australian Mathematical Society;Dec2011, Vol. 91 Issue 3, p391 

    We study a canonical spanning surface obtained from a knot or link diagram, depending on a given Kauffman state. We give a sufficient condition for the surface to be essential. By using the essential surface, we can deduce the triviality and splittability of a knot or link from its diagrams....

  • Strongly n-Trivial Knots. Howards, Hugh; Luecke, John // Bulletin of the London Mathematical Society;Aug2002, Vol. 34 Issue 4, p431 

    The authors prove in this paper that, given any knot k of genus g,k fails to be strongly n-trivial for all n with n ≥ 6g − 3. 2000 Mathematics Subject Classification 57M99.

  • A Heuristic Knot Placement Algorithm for B-Spline Curve Approximation. Weishi Li; Shuhong Xu; Gang Zhao; Li Ping Goh // Computer-Aided Design & Applications (Computer-Aided Design & Ap;2004, Vol. 1 Issue 1-4, p727 

    A new knot placement algorithm for B-spline curve approximating to dense and noisy data points is presented in this paper. In this algorithm, the discrete curvature of the points, in contrast to the points themselves as in the traditional approaches, is smoothed to expose the curvature...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics