A permanent formula for the Jones polynomial (Q719783): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aam.2011.03.003 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jessica E. Banks / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jessica E. Banks / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3105961863 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0705.4548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The BQP-hardness of approximating the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial quantum algorithm for approximating the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Melvin-Morton-Rozansky conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Counting and Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and the colored Jones function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the Jones and Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hecke algebra representations of braid groups and link polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On knot invariants related to some statistical mechanical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monte-Carlo Algorithm for Estimating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Yang-Baxter equation and invariants of links / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AAM.2011.03.003 / rank
 
Normal rank

Latest revision as of 02:01, 10 December 2024

scientific article
Language Label Description Also known as
English
A permanent formula for the Jones polynomial
scientific article

    Statements

    A permanent formula for the Jones polynomial (English)
    0 references
    0 references
    0 references
    11 October 2011
    0 references
    The authors consider the permanent of a square matrix, the definition of which is similar to the one for the determinant, but without using signs. Given an \(n\)-crossing diagram \(D\) of a link, the paper under review gives an expression for the Jones polynomial in terms of the permanent of a \((7n)\times(7n)\) matrix. This improves on a similar, more general, formula in [\textit{L. G. Valiant}, Conference Record of the Eleventh Annual ACM Symposium on Theory of Computing (Atlanta, Ga., 1979), ACM, New York, 249--261 (1979)] that uses an \((n^2)\times(n^2)\) matrix. This \((7n)\times(7n)\) matrix is constructed from a directed graph given by replacing each crossing of the diagram \(D\) with a `gadget' --- one of two fixed directed graphs with 7 vertices immersed in the plane of the diagram.
    0 references
    Jones polynomial
    0 references
    Permanent
    0 references
    State sums
    0 references
    Approximation
    0 references
    Quantum computing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references