Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T21:29:46.408Z Has data issue: false hasContentIssue false

Čebyšev Sets in Hyperspaces over Rn

Published online by Cambridge University Press:  20 November 2018

Robert J. MacG. Dawson
Affiliation:
Dept. of Mathematics and, Computing Science, Saint Mary’s University, Halifax, Nova Scotia, Canada, rdawson@cs.stmarys.ca
Maria Moszyńska
Affiliation:
Institute of Mathematics, University of Warsaw, Banacha 2, 02-097 Warszawa, Poland, mariamos@mimuw.edu.pl
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A set in a metric space is called a Čebyšev set if it has a unique “nearest neighbour” to each point of the space. In this paper we generalize this notion, defining a set to be Čebyšev relative to another set if every point in the second set has a unique “nearest neighbour” in the first. We are interested in Čebyšev sets in some hyperspaces over ${{\text{R}}^{n}}$ , endowed with the Hausdorff metric, mainly the hyperspaces of compact sets, compact convex sets, and strictly convex compact sets.

We present some new classes of Čebyšev and relatively Čebyšev sets in various hyperspaces. In particular, we show that certain nested families of sets are Čebyšev. As these families are characterized purely in terms of containment,without reference to the semi-linear structure of the underlyingmetric space, their properties differ markedly from those of known Čebyšev sets.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2009