Computing finite type invariants efficiently
Proceedings of the American Mathematical Society · 22.04.2026
DOI: 10.1090/proc/17441 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the American Mathematical Society, online erschienen am 22.04.2026. Verfasst von Dror Bar-Natan und 3 weiteren Autor:innen. Die Arbeit nennt 7 Literaturangaben. Gefördert von: Natural Sciences and Engineering Research Council of Canada, National Science Foundation.
Abstract (Originalsprache)
We describe an efficient algorithm to compute finite type invariants of type k k by first creating, for a given knot K K with n n crossings, a look-up table for all subdiagrams of K K of size ⌈ k 2 ⌉ \lceil \frac {k}{2}\rceil indexed by dyadic intervals in [ 0 , 2 n − 1 ] [0,2n-1] . Using this algorithm, any such finite type invariant can be computed on an n n -crossing knot in time O ~ ( n ⌈ k 2 ⌉ ) {\tilde {O}}(n^{\lceil \frac {k}{2}\rceil }) , a lot faster than the previously best published bound of O ~ ( n k ) {\tilde {O}}(n^k) .
Förderung
- Natural Sciences and Engineering Research Council of Canada
- National Science Foundation
Zitieren
APA
Bar-Natan, D., Bar-Natan, I., Halacheva, I., & Scherich, N. (2026). Computing finite type invariants efficiently. Proceedings of the American Mathematical Society. https://doi.org/10.1090/proc/17441
Vancouver
Bar-Natan D, Bar-Natan I, Halacheva I, Scherich N. Computing finite type invariants efficiently. Proceedings of the American Mathematical Society. 2026. doi:10.1090/proc/17441
BibTeX
@article{BarNatan2026,
author = {Bar-Natan, Dror and Bar-Natan, Itai and Halacheva, Iva and Scherich, Nancy},
title = {Computing finite type invariants efficiently},
journal = {Proceedings of the American Mathematical Society},
year = {2026},
doi = {10.1090/proc/17441}
}
EUVIMED