A new way to evaluate MOY graphs

Louis-Hadrien Robert

A new way to evaluate MOY graphs

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 1512.02370 v3 pith:X4IXP32G submitted 2015-12-08 math.QA math.COmath.RT

Louis-Hadrien Robert This is my paper · ORCID

classification math.QAmath.COmath.RT

keywords graphsevaluateevaluationmathfrakprovecheckingclassicalcoincides

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

abstract

We define a new way to evaluate MOY graphs. We prove that this new evaluation coincides with the classical evaluation by checking some skein relations. As a consequence, we prove a formula which relates the $\mathfrak{sl}_N$ and $\mathfrak{sl}_{N-1}$-evaluations of MOY graphs.

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

MOY calculus in type D
math.QA 2025-01 conditional novelty 6.0 of 10

A positive state sum for type D webs yields a framed unoriented link invariant that equals the so(2N) Reshetikhin-Turaev invariant after changing q to -q.

Pith tools