2000 character limit reached
On the volume simplicity constraint in the EPRL spin foam model (1710.06195v1)
Published 17 Oct 2017 in gr-qc
Abstract: We propose a quantum version of the quadratic volume simplicity constraint for the EPRL spin foam model. It relies on a formula for the volume of 4-dimensional polyhedra, depending on its bivectors and the knotting class of its boundary graph. While this leads to no further condition for the 4-simplex, the constraint becomes non-trivial for more complicated boundary graphs. We show that, in the semi-classical limit of the hypercuboidal graph, the constraint turns into the geometricity condition observed recently by several authors.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.