1998
DOI: 10.1016/s0010-4655(98)00132-5
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for determining whether a space-time is homothetic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2002
2002
2021
2021

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(12 citation statements)
references
References 11 publications
0
12
0
Order By: Relevance
“…In the case of stationary black holes, the Cartan invariants have been shown to detect the event horizon [13,25], thereby providing an alternative set of invariants which are easier to compute than the related SPIs. We believe that by exploring the relationship between J D and the Cartan invariants, additional conformally covariant invariants may be produced and this will give insight into the equivalence of spacetimes under the conformal group [28][29][30].…”
Section: Discussionmentioning
confidence: 99%
“…In the case of stationary black holes, the Cartan invariants have been shown to detect the event horizon [13,25], thereby providing an alternative set of invariants which are easier to compute than the related SPIs. We believe that by exploring the relationship between J D and the Cartan invariants, additional conformally covariant invariants may be produced and this will give insight into the equivalence of spacetimes under the conformal group [28][29][30].…”
Section: Discussionmentioning
confidence: 99%
“…CA can check (Joly 1987 {Sheep}) or find a metric’s isometry group (Karlhede and MacCallum 1982 ; Araujo and Skea 1988a , b ; Araujo et al. 1992 ; Grebot and Wolf 1994 {Sheep, Reduce}) and other symmetries such as homothety (McIntosh and Steele 1991 ; Koutras and Skea 1998 ; Vaz and Collinson 1993 {Sheep, Reduce}) or conformal motions. Some applications are described in McLenaghan and van den Bergh ( 1993 ) {Maple}, O’Connor and Prince ( 1998 ) and Hickman and Yazdan ( 2017 ) {Dimsym, Exterior} and in the next subsection.…”
Section: Applicationsmentioning
confidence: 99%
“…Although the Karlhede algorithm is more efficient than the original procedures proposed by Cartan or Brans [4], it may need to go as far as to R 7 [21], and as a consequence, for some spacetimes, long complicated calculations are required, which usually need computer support, e.g., using the programme CLASSI [1], or the Maple-based GRTensor programme [18]. Subsequently, it has been shown how the Karlhede algorithm can be exploited to determine the structure of the isometry group of the spacetime, as well as subclasses within the spacetime which have additional isometries [22]; more recently the scheme has been the basis for an algorithm which determines whether a spacetime admits a homothetic Killing vector [25].…”
Section: Karlhede Algorithm For Invariant Classification Of Metricsmentioning
confidence: 99%
“…Koutras and Skea [25] have given an algorithm to determine whether a spacetime admits a homothetic vector 11 . This algorithm was designed to exploit an invariant classification using the Karlhede algorithm, but it is easy to see that it can be used for any invariant classification, as given below: (1) Use an existing classification algorithm to provide an invariant classification of the spacetime, R n .…”
Section: Homothetic Killing Vector In Intrinsic Coordinate Versionmentioning
confidence: 99%
See 1 more Smart Citation