2000 character limit reached
Farthest point problem and M-compact sets
Published 13 May 2016 in math.FA | (1605.04100v1)
Abstract: In this paper we give an elementary proof of the fact that every uniquely remotal set is singleton in a finite dimensional strictly convex normed linear space. We show that if A is a uniquely remotal M-compact subset with the derived set of A non-empty then the derived set of A is M-compact and uniquely remotal. We also show that if A is a uniquely remotal M-compact set and the derived set of A is compact then A is singleton.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.