Journals / Turkish Journal of Mathematics / 2004 / Cilt: 28 - Sayı: 1

Quasipositivity Problem for 3-Braids

Pages
89–93
Publication Date
2022-11-04
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

In particular, our result can be interpreted as a classification of trigonal real pseudoholomorphic curves on rational ruled surfaces.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:A braid is called quasipositive if it is a product of conjugates of standard generators of the braid group.
📊
Key Findings & Data:The complexity (the time of work) of our algorithm is O(nk+1) where n is the length of the word in standard generators representing the braid and k is the algebraic length of the braid.
💡
Conclusion & Impact:In particular, our result can be interpreted as a classification of trigonal real pseudoholomorphic curves on rational ruled surfaces.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Braid group · quasipositive braids · Braid group

Abstract

A braid is called quasipositive if it is a product of conjugates of standard generators of the braid group. We present an algorithm deciding if a given braid with three strings is quasipositive or not. The complexity (the time of work) of our algorithm is O(nk+1) where n is the length of the word in standard generators representing the braid and k is the algebraic length of the braid. The algorithm is based on the Garside normal form. The problem of quasipositivity in braid groups is motivated by the topology of plane real algebraic curves (16th Hilbert's problem). In particular, our result can be interpreted as a classification of trigonal real pseudoholomorphic curves on rational ruled surfaces.

Özet

A braid is called quasipositive if it is a product of conjugates of standard generators of the braid group. We present an algorithm deciding if a given braid with three strings is quasipositive or not. The complexity (the time of work) of our algorithm is O(nk+1) where n is the length of the word in standard generators representing the braid and k is the algebraic length of the braid. The algorithm is based on the Garside normal form. The problem of quasipositivity in braid groups is motivated by the topology of plane real algebraic curves (16th Hilbert's problem). In particular, our result can be interpreted as a classification of trigonal real pseudoholomorphic curves on rational ruled surfaces.

🔖

Cite This Article

OREVKOV, S. Y. (2022). Quasipositivity Problem for 3-Braids. Turkish Journal of Mathematics, Cilt: 28 - Sayı: 1, 89–93. https://ajindex.com/articles/608796

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...