Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 158

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Uniqueness of the Newman–Janis Algorithm in Generating the Kerr–Newman Metric

Open access
Drake, S. P., Szekeres, Peter·2000·General Relativity and Gravitation

Abstract

A ftertheoriginaldiscovery oftheK errm etric,N ewm an and Janis showed that this solution could be \derived" by m aking an elem en-tary com plex transform ation to theSchwarzschild solution.Thesam e m ethod was then used to obtain a new stationary axisym m etric solution to Einstein’s (cid:12)eld equations now known as the K err-newm an m etric,representing a rotating m assive charged black hole. H owever no clearreason haseverbeen given asto why theN ewm an-Janisalgo-rithm works,m any physicistconsidering itto be an ad hoc procedure or \(cid:13)uke" and not worthy offurther investigation. Contrary to this beliefthis paper shows why the N ewm an-Janis algorithm is successfulin obtaining the K err-N ewm an m etric by rem oving som e of the am biguities present in the originalderivation. Finally we show that theonly perfect(cid:13)uid generated by theN ewm an-Janisalgorithm isthe (vacuum ) K err m etric and that the only Petrov typed D solution to the Einstein-M axwellequationsisthe K err-N ewm an m etric.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1023/a:1001920232180

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 158

Metadata

Authors
Drake, S. P., & Szekeres, P.
Venue
General Relativity and Gravitation
Published
2000-03
Volume
32
Issue
3
Pages
445-457
ISSN
  • 0001-7701 (ISSN-L)
  • 1572-9532
OpenAlex
W2121304817
Cited by
158
References
2
FWCI
0.25
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Uniqueness of the Newman–Janis Algorithm in Generating the Kerr–Newman Metric. https://app.cochat.ai/papers/10.1023/a:1001920232180
The paper
Drake, S. P., & Szekeres, P. (2000). Uniqueness of the Newman–Janis Algorithm in Generating the Kerr–Newman Metric. General Relativity and Gravitation. https://doi.org/10.1023/a%3A1001920232180

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.