arXiv · 1503.00752
Curve Diagrams, Laminations, and the Geometric Complexity of Braids
Abstract
Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function. We compute explicitly the geometric generating function for the group of braids on three strands and prove that it is neither rational nor algebraic, nor even holonomic. This result may appear as counterintuitive. Indeed, the standard complexity (due to the Artin presentation of braid groups) is algorithmically harder to compute than the geometric complexity, yet the associated generating function for the group of braids on three strands is rational.
Explore related subjects
Keep this discovery
Vincent Jugé. 2015-06-02. Curve Diagrams, Laminations, and the Geometric Complexity of Braids. https://doi.org/10.1142/s0218216515500431
Cite the original work for its findings. Save a collection to share your selection of sources.