The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 101 –
120 of
279
A topological space is called mesocompact (sequentially mesocompact) if for every open cover of , there exists an open refinement of such that is finite for every compact set (converging sequence including its limit point) in . In this paper, we give some characterizations of mesocompact (sequentially mesocompact) spaces using selection theory.
We prove a number of results involving categories enriched over CMet, the category of complete metric spaces with possibly infinite distances. The category CPMet of path complete metric spaces is locally -presentable, closed monoidal, and coreflective in CMet. We also prove that the category CCMet of convex complete metric spaces is not closed monoidal and characterize the isometry--generated objects in CMet, CPMet and CCMet, answering questions by Di Liberti and Rosický. Other results include...
If (X,d) is a metric space then a map f: X → X is defined to be a weak contraction if d(f(x),f(y)) < d(x,y) for all x,y ∈ X, x ≠ y. We determine the simplest non-closed sets X ⊆ ℝⁿ in the sense of descriptive set-theoretic complexity such that every weak contraction f: X → X is constant. In order to do so, we prove that there exists a non-closed set F ⊆ ℝ such that every weak contraction f: F → F is constant. Similarly, there exists a non-closed set G ⊆ ℝ such that every weak contraction...
Currently displaying 101 –
120 of
279