Related papers: Nearest point problem in countably normed spaces

A dual pair formulation for asymmetric locally convex spaces is developed that strictly generalises the ordinary vector space setting. The concept of a polar topology carries over to the asymmetric case and some familiar results are…

Plausibility measures are structures for reasoning in the face of uncertainty that generalize probabilities, unifying them with weaker structures like possibility measures and comparative probability relations. So far, the theory of…

A metric space $(M, d)$ is said to be universal for a class of metric spaces if all metric spaces in the class can be isometrically embedded into $(M, d)$. In this paper, for a metrizable space $Z$ possessing abundant subspaces, we first…

We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCSPs). We show that a single counting quantifier strictly…

In this paper, we study a part of approximation theory that presents the conditions under which a closed set in a normed linear space is proximinal or Chebyshev.

Let X be a normed space. A subset A of X is approximately convex if $d(ta+(1-t)b,A) \le 1$ for all $a,b \in A$ and $t \in [0,1]$ where $d(x,A)$ is the distance of $x$ to $A$. Let $\Co(A)$ be the convex hull and $\diam(A)$ the diameter of…

In this paper we address the question whether in a given Banach space, a Chebyshev center of a nonempty bounded subset can be a farthest point of the set. Our exploration reveals that the answer depends on the convexity properties of the…

This study focuses on defining normal and strictly convex structures within Menger cone PM-space. It also presents a shared fixed point theorem for the existence of two self-mappings constructed on a strictly convex probabilistic cone…

This paper investigates instances of Sobolev embeddings characterized by local compactness at every point within their domain, except for a single point. We obtain the sharp conditions that distinguish compactness from non-compactness and…

The Erberlein-Smulian Theorem asserts that for complete normed spaces, that is Banach spaces, a subset is weak compact if and only if it is weak sequentially compact. In this paper it is shown that the completeness of the normed space is…

A unary constraint (on the Boolean domain) is a function from {0,1} to the set of real numbers. A free use of auxiliary unary constraints given besides input instances has proven to be useful in establishing a complete classification of the…

In this paper we have found a necessary and sufficient condition for equivalence of two norms on a linear space using the theory of exponential vector space. Exponential vector space is an ordered algebraic structure which can be considered…

In nearest-neighbor classification problems, a set of $d$-dimensional training points are given, each with a known classification, and are used to infer unknown classifications of other points by using the same classification as the nearest…

We initiate the rigorous study of classification in quasi-metric spaces. These are point sets endowed with a distance function that is non-negative and also satisfies the triangle inequality, but is asymmetric. We develop and refine a…

We show a number of undecidable assertions concerning countably compact spaces hold under PFA(S)[S]. We also show the consistency without large cardinals of "every locally compact, perfectly normal space is paracompact".

We prove, assuming Souslin's Hypothesis, that each uncountable subspace of each zero-dimensional monotonically normal compact space contains an uncountable subset of the real line with either the metric, the Sorgenfrey, or the discrete…

It is proved that if some boundary $B$ of a convex compact subset $X$ of a locally convex linear space has a countable network, then the convex compact space $X$ is metrizable. If the boundary $B$ is a Lindelof $\Sigma$-space, then the…

In this paper we first extend from normed spaces to locally convex spaces some characterizations of denting points in convex sets. On the other hand, we also prove that in an infrabarreled locally convex space a point in a convex set is…

The problem of computing a common point that lies in the intersection of a finite number of closed convex sets, each known to one agent in a network, is studied. This issue, known as the distributed convex feasibility problem or the…

We use bicombings on arcwise connected metric spaces to give definitions of convex sets and extremal points. These notions coincide with the customary ones in the classes of normed vector spaces and geodesic metric spaces which are convex…