arXiv (OAI Expanded)
open access
Deciding strong quasipositivity and quasipositivity
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 li
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Correspondence analysis for strong three-valued logic#108750
- Independent Set Discovery on Biclique-Free Graphs Is Fixed-Parameter Tractable#1064381
- Wold-type decompositions for norm-increasing $m$-concave weighted shifts on directed trees#1084597
- A Polynomial Kernel for Planar Directed Feedback Vertex Set#1049406
- Mechanistic Interpretability of LLM Jailbreaks via Internal Attribution Graphs#353001
Record · ID 1123708
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive