Complexity of distances: Reductions of distances between metric and Banach spaces

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F22%3A00557873" target="_blank" >RIV/67985840:_____/22:00557873 - isvavai.cz</a>
Alternative codes found
RIV/00216208:11320/22:10456413
Result on the web
<a href="https://doi.org/10.1007/s11856-022-2305-7" target="_blank" >https://doi.org/10.1007/s11856-022-2305-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11856-022-2305-7" target="_blank" >10.1007/s11856-022-2305-7</a>

Result language
angličtina
Original language name
Complexity of distances: Reductions of distances between metric and Banach spaces
Original language description
We show that all the standard distances from metric geometry and functional analysis, such as Gromov-Hausdorff distance, Banach-Mazur distance, Kadets distance, Lipschitz distance, Net distance, and Hausdorff-Lipschitz distance have all the same complexity and are reducible to each other in a precisely defined way. This is done in terms of descriptive set theory and is a part of a larger research program initiated by the authors in [8]. The paper is however targeted also to specialists in metric geometry and geometry of Banach spaces.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)