An efficient algorithm for the Riemannian 10 j symbols

DOI10.1088/0264-9381/19/6/310MaRDI QIDQ4532784zbMATH OpenOpenAlexWikidataFDO

Authors J. Daniel Christensen, Greg Egan

Publication date 24 July 2002

Published in Classical and Quantum Gravity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/gr-qc/0110045

zbMATH Keywords

Riemannian quantum gravityspin networks

Mathematics Subject Classification ID

Connections of hypergeometric functions with groups and algebras, and related topics (33C80) Computational methods for problems pertaining to relativity and gravitational theory (83-08) Quantization of the gravitational field (83C45)

Abstract: The 10j symbol is a spin network that appears in the partition function for the Barrett-Crane model of Riemannian quantum gravity. Elementary methods of calculating the 10j symbol require order(j^9) or more operations and order(j^2) or more space, where j is the average spin. We present an algorithm that computes the 10j symbol using order(j^5) operations and order(j^2) space, and a variant that uses order(j^6) operations and a constant amount of space. An implementation has been made available on the web.

Recommendations

• Asymptotics of 10 j symbols
• Algorithms for computer algebra calculations in spacetime: I. The calculation of curvature
• Calculation of primitive 6-j symbols
• Asymptotics of 6 j and 10 j symbols
• Asymptotics of relativistic spin networks

Cited in

(1)

• SU(2) graph invariants, Regge actions and polytopes

This page was built for publication: An efficient algorithm for the Riemannian 10 j symbols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4532784)