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.
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.
A map (= continuous function) is of order ≤ k if each of its point-inverses has at most k elements. Following [4], maps of order ≤ 2 are called simple.
Which maps are compositions of simple closed [open, clopen] maps? How many simple maps are really needed to represent a given map? It is proved herein that every closed map of order ≤ k defined on an n-dimensional metric space is a composition of (n+1)k-1 simple closed maps (with metric domains). This theorem fails to be true...
Fedorchuk's fully closed (continuous) maps and resolutions are applied in constructions of non-metrizable higher-dimensional analogues of Anderson, Choquet, and Cook's rigid continua. Certain theorems on dimension-lowering maps are proved for inductive dimensions and fully closed maps from spaces that need not be hereditarily normal, and some of the examples of continua we construct have non-coinciding dimensions.
It is shown that for every at most k-to-one closed continuous map f from a non-empty n-dimensional metric space X, there exists a closed continuous map g from a zero-dimensional metric space onto X such that the composition f∘g is an at most (n+k)-to-one map. This implies that f is a composition of n+k-1 simple ( = at most two-to-one) closed continuous maps. Stronger conclusions are obtained for maps from Anderson-Choquet spaces and ones that satisfy W. Hurewicz's condition (α). The main tool is...
It is shown that a certain indecomposable chainable continuum is the domain of an exactly two-to-one continuous map. This answers a question of Jo W. Heath.
For each natural number n ≥ 1 and each pair of ordinals α,β with n ≤ α ≤ β ≤ ω(⁺), where ω(⁺) is the first ordinal of cardinality ⁺, we construct a continuum such that
(a) ;
(b) ;
(c) ;
(d) if β < ω(⁺), then is separable and first countable;
(e) if n = 1, then can be made chainable or hereditarily decomposable;
(f) if α = β < ω(⁺), then can be made hereditarily indecomposable;
(g) if n = 1 and α = β < ω(⁺), then can be made chainable and hereditarily indecomposable.
In particular,...
Download Results (CSV)