Asymptotics of classical spin networks. With an appendix by Don Zagier (Q1938774): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 06:17, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Asymptotics of classical spin networks. With an appendix by Don Zagier |
scientific article |
Statements
Asymptotics of classical spin networks. With an appendix by Don Zagier (English)
0 references
25 February 2013
0 references
A spin network is a pair \((\Gamma,\gamma)\) of a cubic graph \(\Gamma\) with a cyclic ordering of the edges around its vertices, together with a colouring \(\gamma\) of the edges of \(\Gamma\) by natural numbers, satisfying some conditions. The Penrose evaluation associates a rational number \(\langle \Gamma,\gamma\rangle\) to a spin network. Physics suggests that the asymptotic behaviour of \(\langle\Gamma, k\gamma\rangle\) where \(k\) goes to infinity corresponds to a classical limit of quantum mechanics and should therefore recover Eulidean geometric quantities. For quantum spin networks, one such conjecture is the Volume Conjecture. The main result in the paper under review is that the sequence \(k\mapsto \langle \Gamma, k\gamma\rangle\) is a \(G\)--function (Theorem 1.9), implying that \(\langle \Gamma, k\gamma\rangle\) is of Nilsson type, which in turn implies the existence of an asymptotic expansion of the sequence \(\langle \Gamma, k\gamma\rangle\) for all spin networks. A second result in this paper is Theorem 1.7, which generalizes Westbury's formula for the evaluation of the `generating series' for a spin network from planar graphs to general (possibly non-planar) graphs \textit{B. W. Westbury} [Banach Cent. Publ. 42, 447--456 (1998; Zbl 0902.57010)]. The reviewer finds the combinatorics of this proof to be exceptionally beautiful. A third result is a number of explicit computations of \(6j\)-symbols (the case of \(\Gamma\) being a tetrahedron graph) using a new technique, the ``Wilf-Zielberger Method'' (Section 4.1). Finally, the appendix by Don Zagier contains computations and conjectures for the regular cube \(12j\) spin network. \textit{F. Costantino} and \textit{J. Marché} have an alternative approach to the asymptotics of spin networks, which allows for holonomies along edges [``Generating series and asymptotics of classical spin networks'', \url{arXiv:1103.5644}].
0 references
spin networks
0 references
ribbon graphs
0 references
\(6j\)-symbols
0 references
Racah coefficients
0 references
angular momentum
0 references
asymptotics
0 references
\(G\)-functions
0 references
Kauffman bracket
0 references
Jones polynomial
0 references
Borel transform
0 references
enumerative combinatorics
0 references
recoupling
0 references
Nilsson
0 references
volume conjecture
0 references