Pith. sign in

REVIEW

Complexity and Near Extremal Charged Black Branes

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 1901.00689 v3 pith:N4GOL5ZD submitted 2019-01-03 hep-th

Complexity and Near Extremal Charged Black Branes

classification hep-th
keywords complexitynearblackchargedcutoffextremalhorizonlimit
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We compute holographic complexity of charged black brane solutions in arbitrary dimensions for the near horizon limit of near extremal case using two different methods. The corresponding complexity may be obtained either by taking the limit from the complexity of the charged black brane, or by computing the complexity for near horizon limit of near extremal solution. One observes that these results coincide if one assumes to have a cutoff behind horizon whose value is fixed by UV cutoff and also taking into account a proper counterterm evaluated on this cutoff. We also consider the situation for Vaidya charged black branes too.

discussion (0)

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