In search of minimal random braid configurations

DOI10.1088/0305-4470/35/1/304zbMATH Open0999.68224OpenAlexW2032826787MaRDI QIDQ4533840FDOQ4533840

Authors: Patrick D. Bangert, Mitchell A. Berger, R. Prandi 

Publication date: 11 June 2002

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0305-4470/35/1/304

Recommendations

• Minimum crossing numbers for 3-braids
• Braids and Knots
• Automatic calculation of minimum crossing numbers of 3-braids.
• The set of minimal braids is co-NP-complete
• Curve diagrams, laminations, and the geometric complexity of braids

zbMATH Keywords

geometric braid

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (7)

• Automatic calculation of minimum crossing numbers of 3-braids.
• ON TOPOLOGICAL CORRELATIONS IN TRIVIAL KNOTS: FROM BROWNIAN BRIDGES TO CRUMPLED GLOBULES
• Finite-time braiding exponents
• Randomly growing braid on three strands and the Manta Ray
• The set of minimal braids is co-NP-complete
• Braiding minimal sets of vector fields
• Crossing-changeable braids from chromatic configuration spaces

This page was built for publication: In search of minimal random braid configurations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4533840)