Pith. sign in

REVIEW 1 cited by

A computation in Khovanov-Rozansky Homology

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0801.4018 v4 pith:2CAKDYQ2 submitted 2008-01-25 math.GT math.QA

Daniel Krasner This is my paper · ORCID
classification math.GTmath.QA
keywords homologykhovanov-rozanskyalgorithmcertaincomparecomplexescompositionscomputation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We investigate the Khovanov-Rozansky invariant of a certain tangle and its compositions. Surprisingly the complexes we encounter reduce to ones that are very simple. Furthermore, we discuss a "local" algorithm for computing Khovanov-Rozansky homology and compare our results with those for the "foam" version of sl_3-homology.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bipartite expansion beyond biparticity

    hep-th 2025-01 conditional novelty 6.0 of 10

    The authors construct positive decompositions of fundamental HOMFLY polynomials in variables φ, φ̄, D for arbitrary knots, not just bipartite ones, and give a criterion to detect when such a decomposition conceals a b...

Pith tools