Asymptotics of quantum spin networks at a fixed root of unity (Q411343): Difference between revisions

A spin network is a ribbon graph equipped with an admissible coloring of its edges by natural numbers. Such objects were used by Penrose in the 1960s, in his attempt to quantize gravity combinatorially. Quantum spin networks differ from the classical ones by the fact that the underlying ribbon graph is knotted and by the fact that the evaluations are polynomials of a variable \(q\) (and not just integer numbers, as in the case of classical spin networks). One important problem in classical and in quantum spin network theory is their asymptotic behavior. The authors of the paper under review recently showed [``Asymptotics of classical spin networks'', \url{arXiv:0902.3113}] the existence of a general asymptotic expansion for classical networks. The methods involve the conversion of the problem into questions of algebraic geometry and number theory, an the use of \(G\)-functions. In the paper under review, the authors extend the results and the methods they developed in the case of the asymptotics of classical spin networks to the case of asymptotics of quantum spin networks of arbitrary valency at a fixed root of unity.