Abstract
The set of extremal trajectories is completely described. Their construction is reduced to finding the best routes on a directed graph whose vertices are subsets (boxes) of \(Y\backslash \mathop \cup \limits_S K\left( S \right)\) and whose edges are segments T(S) of the trajectory T that intersect the cones K(S) in the “best way.” The edge length is the deviation of S from T(S). The best routes are ones for which the length of the shortest edge is maximal.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
V. I. Berdyshev, Dokl. Math. 96 (2), 538–540 (2017).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.I. Berdyshev, 2018, published in Doklady Akademii Nauk, 2018, Vol. 483, No. 1.
Rights and permissions
About this article
Cite this article
Berdyshev, V.I. Class of Trajectories ℝ3 in Most Remote from Observers. Dokl. Math. 98, 652–654 (2018). https://doi.org/10.1134/S1064562418070025
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064562418070025