Computational complexity of graded knot invariant

Many classical knot polynomials are defined using skein relations. For a link diagram with [Formula: see text] crossings, direct computation has roughly exponential complexity. In this paper, the authors introduce a graded knot invariant. It has polynomial complexity in each grade.

Authors

Zhiqing Yang (ORCID: https://orcid.org/0000-0003-2017-6583)
Zhigang Bao (ORCID: https://orcid.org/0000-0003-3036-1475)

Institutions

Dalian University of Technology (CN)

Publication Details

Journal: Journal of Knot Theory and Its Ramifications
Published: 2025-12-06
DOI: https://doi.org/10.1142/s0218216526400067
Primary Topic: Geometric and Algebraic Topology
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Computational complexity of graded knot invariant

Zhiqing Yang, Zhigang Bao

Dec 6, 2025

Journal of Knot Theory and Its Ramifications

Geometric and Algebraic Topology

article

Computational complexity of graded knot invariant

Zhiqing Yang, Zhigang Bao

December 6, 2025article en

Abstract

Journal of Knot Theory and Its Ramifications

Dalian University of Technology (CN)

Openalex Percentile: Top 56%

Geometric and Algebraic Topology

DOI Source OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Computational complexity of graded knot invariant — Zhiqing Yang, Zhigang Bao · Journal of Knot Theory and Its Ramifications (2025) | TGRS Research Map | TGRS