PreprintarXiv licencearXiv
Deciding strong quasipositivity and quasipositivity
Abstract
We present two results concerning the decidability of (strong) quasipositivity of links in the 3-sphere. First, using a result of Dynnikov--Prasolov, we provide an algorithm to decide whether or not a link is strongly quasipositive. Second, we reduce the decision problem of the quasipositivity of links to that of braids.
Related
- Convex ribbon disks, quasipositivity, and Lagrangian sliceness
- On deciding transcendence of power series
- Deciding monotonicity of simple drawings of the complete graph
- Deciding lettericity is NP-complete, even for four-colorable comparability graphs
- Deciding superellipticity and computing the Weierstrass normal form
BibTeX
@misc{kegel2026deciding,
title = {{Deciding strong quasipositivity and quasipositivity}},
author = {Marc Kegel and Qiuyu Ren},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.17341},
eprint = {2609.17341},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.17341},
}
RIS
TY - UNPB
TI - Deciding strong quasipositivity and quasipositivity
AU - Marc Kegel
AU - Qiuyu Ren
PY - 2026
DA - 2026/09/15
PB - arXiv
DO - 10.48550/arxiv.2609.17341
UR - https://arxiv.org/abs/2609.17341
AB - We present two results concerning the decidability of (strong) quasipositivity of links in the 3-sphere. First, using a result of Dynnikov--Prasolov, we provide an algorithm to decide whether or not a link is strongly quasipositive. Second, we reduce the decision problem of the quasipositivity of links to that of braids.
ER -