Intrinsic, deductive, explicit, and algorithmic characterization of the Szekeres-Szafron solutions

Abstract

We write the known invariant definition of the Szekeres-Szafron family of solutions in an intrinsic, deductive, explicit and algorithmic form. We also intrinsically characterize the two commonly considered subfamilies, and analyze other subclasses, also defined by first-order differential conditions. Furthermore, we present a Rainich-like approach to these metrics.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…