ISSN 1683-3414 (Print)   •   ISSN 1814-0807 (Online)
   Log in
 

Contacts

Address: Vatutina st. 53, Vladikavkaz,
362025, RNO-A, Russia
Phone: (8672)23-00-54
E-mail: rio@smath.ru

 

 

 

.

DOI: 10.23671/VNC.2020.1.57537

About Some Properties of Similarly Homogeneous \(\mathbb {R}\)-Trees

Bulygin, A. I.
Vladikavkaz Mathematical Journal 2020. Vol. 22. Issue 1.
Abstract:
In this paper we consider the properties of locally complete similarly homogeneous inhomogeneous \(\mathbb{R}\)-trees. The geodesic space is called \(\mathbb{R}\)-tree if any two points may be connected by the unique arc. The general problem of A. D. Alexandrov on the characterization of metric spaces is considered. The distance one preserving mappings are constructed for some classes of \(\mathbb{R}\)-trees. To do this, we use the construction with the help of which a new special metric is introduced on an arbitrary metric space. In terms of this new metric, a criterion is formulated that is necessary for a so that a distance one preserving mapping to be isometric. In this case, the characterization by A. D. Alexandrov is not fulfilled. Moreover, the boundary of a strictly vertical \(\mathbb{R}\)-tree is also studied. It is proved that any horosphere in a strictly vertical \(\mathbb{R}\)-tree is an ultrametric space. If the branch number of a strictly vertical \(\mathbb{R}\)-tree is not greater than the continuum, then the cardinality of any sphere and any horosphere in the \(\mathbb{R}\)-tree equals the continuum, and if the branch number of \(\mathbb{R}\)-tree islarger than the continuum, then the cardinality of any sphere or horosphere equals the number of branches.
Keywords: similarly homogeneous space, strictly vertical \(\mathbb{R}\)-tree, metric, horosphere.
Language: Russian Download the full text  
For citation: Bulygin, A. I. About Some Properties of Similarly Homogeneous \(\mathbb {R}\)-Trees, Vladikavkaz Math. J., 2020, vol. 22, no. 1, pp.33-42 (in Russian). DOI 10.23671/VNC.2020.1.57537
+ References


← Contents of issue
 
  | Home | Editorial board | Publication ethics | Peer review guidelines | Current | Archive | Rules for authors | Send an article |  
1999-2023