Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · gr-qc/0005081

The newest release of the Ortocartan set of programs for algebraic calculations in relativity

Andrzej Krasinski
View original source ↗Read source document ↗Export metadata ↓

Abstract

The program Ortocartan for algebraic calculations in relativity has just been implemented in the Codemist Standard Lisp and can now be used under the Windows 98 and Linux operating systems. The paper describes the new facilities and subprograms that have been implemented since the previous release in 1992. These are: the possibility to write the output as Latex input code and as Ortocartan's input code, the calculation of the Ellis evolution equations for the kinematic tensors of flow, the calculation of the curvature tensors from given (torsion-free) connection coefficients in a manifold of arbitrary dimension, the calculation of the lagrangian from a given metric by the Landau-Lifshitz method, the calculation of the Euler-Lagrange equations from a given lagrangian (only for sets of ordinary differential equations) and the calculation of first integrals of sets of ordinary differential equations of second order (the first integrals are assumed to be polynomials of second degree in the first derivatives of the functions).

Explore related subjects

gr-qc

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrzej Krasinski. 2000-07-13. The newest release of the Ortocartan set of programs for algebraic calculations in relativity. https://doi.org/10.1023/a%3A1002028019791

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

An upper bound on the minimum orbital period of black holes

Previous research has focused on establishing lower bounds on the minimum orbital period of black holes. In this work, we explore the complementary question of whether an upper bound exists for the minimum orbital period of black holes. We investigate the minimum orbital periods of three types of black holes: Schwarzschild, Reissner-Nordström and Kerr-Newman black holes. We find that the minimum orbital period of these black holes is bounded by an upper limit $T_{min} \leqslant 6\sqrt{3}πM$, where $M$ is the black hole mass. Our results suggest that this upper bound on the minimum orbital period may be a general property in black hole spacetimes.

gr-qc↗
arXiv2026

Bounds on the minimum orbital period in the background of 5-dimensional charged black holes

In this paper, we study the upper and lower bounds on the minimum orbital period of 5-dimensional charged black holes. Our results indicate that the upper bound of the minimum orbital period corresponds to non-charged black holes, while the lower bound is achieved in the case of maximally charged black holes. We further establish precise analytical expressions for the upper and lower bounds of the minimum orbital period. Our findings provide valuable insights into 5-dimensional charged black holes and help constrain theoretical gravity models.

gr-qc↗
arXiv2026

Analysis of minimum orbital periods around d-dimensional charged black holes

This paper investigates the bounds on the minimum orbital period for test objects around d-dimensional charged black holes in asymptotically flat spacetimes. We derive the exact critical radius and the minimum orbital period. We then prove analytically that the minimum orbital period decreases strictly as the charge of the black hole increases. Thus, the upper limit is reached for an uncharged black hole, while the lower limit is attained for a maximally charged one, and the two bounds take the closed form $\frac{2π(d-2)}{d-3}[(d-2)M]^{\frac{1}{d-3}}\leqslant T_{min} \leqslant 2π\sqrt{\frac{d-1}{d-3}}\,[(d-1)M]^{\frac{1}{d-3}}$. Since the minimum period equals $2π$ times the shadow radius, the upper bound is equivalently a universal upper bound on the shadow radius. These results improve our understanding of dynamics around d-dimensional black holes and impose constraints on candidate gravity theories.

gr-qc↗