logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

COMPUTING FINITE TYPE INVARIANTS EFFICIENTLY

delete2026-07-01
delete0
PRE
AI
B
Bar-Natan, Dror *
B
Bar-Natan, Itai
H
Halacheva, Iva
S
Scherich, Nancy
DOI：10.1090/proc/17441delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We describe an efficient algorithm to compute finite type invariants of type k by first creating, for a given knot K with n crossings, a look-up table for all subdiagrams of K of size k21 indexed by dyadic intervals in [0, 2n-1]. Using this algorithm, any such finite type invariant can be computed on anncrossing knot in time O(nl 2k 1), a lot faster than the previously best published bound of O(nk).
Keywords:
Finite type invariants
Gauss diagrams

Journal

P
Proceedings of the American Mathematical Society
IF:
0.8
Papers:
295
Citations:
0

Organization

U
university of california los angeles
Scholars:
5.3W
Papers: 4.2W
Citations: 89
N
Northeastern University
Scholars:
2.5W
Papers: 1.6W
Citations: 3.0W
University of California System cover
University of California System
Scholars:
37.5W
Papers: 33.7W
Citations: 6.6K
U
university of toronto
Scholars:
14.7W
Papers: 12.0W
Citations: 165
researcher View more organizations