Pith. sign in

REVIEW

Many-nodes/many-links spinfoam: the homogeneous and isotropic case

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1107.2633 v3 pith:MEPGPZJL submitted 2011-07-13 gr-qc

Many-nodes/many-links spinfoam: the homogeneous and isotropic case

classification gr-qc
keywords graphlargelimitspinfoamamplitudearbitraryhomogeneousisotropic
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

I compute the Lorentzian EPRL/FK/KKL spinfoam vertex amplitude for regular graphs, with an arbitrary number of links and nodes, and coherent states peaked on a homogeneous and isotropic geometry. This form of the amplitude can be applied for example to a dipole with an arbitrary number of links or to the 4-simplex given by the compete graph on 5 nodes. All the resulting amplitudes have the same support, independently of the graph used, in the large j (large volume) limit. This implies that they all yield the Friedmann equation: I show this in the presence of the cosmological constant. This result indicates that in the semiclassical limit quantum corrections in spinfoam cosmology do not come from just refining the graph, but rather from relaxing the large j limit.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.