A parallel algorithm for the computation of the Jones polynomial
Proceedings of the National Academy of Sciences · 28.04.2026 · 123 (17)
DOI: 10.1073/pnas.2520332123 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the National Academy of Sciences, online erschienen am 21.04.2026. Verfasst von Kasturi Barkataki und 1 weiteren Autor:innen. Beteiligte Einrichtung: School of Mathematical and Statistical Sciences, Arizona State University, Tempe, AZ 85281. Die Arbeit nennt 69 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: NIGMS NIH HHS, National Science Foundation (NSF), HHS | National Institutes of Health (NIH).
Abstract (Originalsprache)
Knots, links, and entangled filaments appear in many physical systems in biology and engineering and their structural complexity is related to their function. In the context of emerging AI capabilities in predicting new physical structures, as well as in assisting mathematical proofs, the efficient computation of topological invariants and other metrics of entanglement becomes a considerable barrier to scientific advances. The computation of common measures of topological complexity, such as the Jones polynomial, is #P-hard and of exponential time on the number of crossings in a knot(oid) (link(oid)) diagram. In this paper, we introduce a parallel algorithm for the exact computation of the Jones polynomial for (collections of) both open and closed simple curves in 3-space. We prove that this algorithm enables the exponential reduction of the computational time depending on the number of processors. We demonstrate the advantage of this algorithm by applying it to knots, as well as to systems of linear polymers in a melt obtained from molecular dynamics simulations. The method is general and might be applicable to other invariants and measures of complexity.
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- School of Mathematical and Statistical Sciences, Arizona State University, Tempe, AZ 85281.
ORCID-Profile: Kasturi Barkataki, Eleni Panagiotou
Förderung
- NIGMS NIH HHS
- National Science Foundation (NSF)
- HHS | National Institutes of Health (NIH)
Zitieren
APA
Barkataki, K., & Panagiotou, E. (2026). A parallel algorithm for the computation of the Jones polynomial. Proceedings of the National Academy of Sciences, 123(17). https://doi.org/10.1073/pnas.2520332123
Vancouver
Barkataki K, Panagiotou E. A parallel algorithm for the computation of the Jones polynomial. Proceedings of the National Academy of Sciences. 2026;123(17). doi:10.1073/pnas.2520332123
BibTeX
@article{Barkataki2026,
author = {Barkataki, Kasturi and Panagiotou, Eleni},
title = {A parallel algorithm for the computation of the Jones polynomial},
journal = {Proceedings of the National Academy of Sciences},
year = {2026},
volume = {123},
number = {17},
doi = {10.1073/pnas.2520332123}
}
EUVIMED