A counterexample in ANR theory

There is an AR X and a non-AR Y and a continuous surjection f:X→Y so that each point-inverse f^-1(y) is an AR. This solves a problem of Borsuk.     

Minimal sets in compact connected subspaces

Let X be a topological space, f:X→X be a continuous map, and Y be a compact, connected and closed subset of X. In this paper we show that, if the boundary X_∂Y contains exactly one point v and f(v)∈Y, then Y contains a minimal set of f.     

Increasing and decreasing operators on complete lattices

The (isotone) map f: X → X is an increasing (decreasing) operator on the poset X if f(x) ? f²(x) (f²(x) ? f(x), resp.) holds for each x ∈ X. Properties of increasing (decreasing) operators on complete lattices are studied and shown to extend and clarify those of closure (resp. anticlosure) operators. The notion of the decreasing closure, $\text{f}$, (the increasing anticlosure, $\text{f}$,) of the map f: X → X is introduced extending that of the transitive closure, $\text{f}\text{?}$, of f. $\text{f}\text{f}$, and $\text{f}$ are all shown to have the same set of fixed points. Our results enable us to solve some problems raised by H. Crapo. In particular, the order structure of H(X), the set of retraction operators on X is analyzed. For X a complete lattice H(X) is shown to be a complete lattice in the pointwise partial order. We conclude by claiming that it is the increasing-decreasing character of the identity maps which yields the peculiar properties of Galois connections. This is done by defining a u-v connection between the posets X and Y, where u: X → X (v: Y → Y) is an increasing (resp. decreasing) operator to be a pair f, g of maps f; X → Y, g: Y → X such that gf ? u, fg ? v. It is shown that the whole theory of Galois connections can be carried over to u-v connections.     

Extraordinary dimension of maps

We consider the extraordinary dimension dimL introduced recently by Shchepin [E.V. Shchepin, Arithmetic of dimension theory, Russian Math. Surveys 53 (5) (1998) 975-1069]. If L is a CW-complex and X a metrizable space, then dimLX is the smallest number n such that ΣnL is an absolute extensor for X, where ΣnL is the nth suspension of L. We also write dimLf?n, where is a given map, provided dimLf⁻¹(y)?n for every y∈Y. The following result is established: Supposeis a perfect surjection between metrizable spaces, Y a C-space and L a countable CW-complex. Then conditions (1)-(3) below are equivalent:

(1)

dimLf?n;

(2)

There exists a dense andGδsubsetGofC(X,In)with the source limitation topology such thatdimL(f×g)=0for everyg∈G;

(3)

There exists a mapis such thatdimL(f×g)=0;If, in addition, X is compact, then each of the above three conditions is equivalent to the following one;

(4)

There exists anFσsetA⊂Xsuch thatdimLA?n−1and the restriction mapf|(X?A)is of dimensiondimf|(X?A)?0.

     

Making holes in hyperspaces

Let X be a metric continuum and C(X) the hyperspace of all nonempty subcontinua of X. Let A∈C(X), A is said to make a hole in C(X), if C(X)−{A} is not unicoherent. In this paper we study the following problem.Problem: For which A∈C(X), A makes a hole in C(X).In this paper we present some partial solutions to this problem in the following cases: (1) A is a free arc; (2) A is a one-point set; (3) A is a free simple closed curve; (4) A=X.     

A note on the weakly convex and convex domination numbers of a torus

The distanced_G(u,v) between two vertices u and v in a connected graph G is the length of the shortest (u,v) path in G. A (u,v) path of length d_G(u,v) is called a (u,v)-geodesic. A set X⊆V is called weakly convex in G if for every two vertices a,b∈X, exists an (a,b)-geodesic, all of whose vertices belong to X. A set X is convex in G if for all a,b∈X all vertices from every (a,b)-geodesic belong to X. The weakly convex domination number of a graph G is the minimum cardinality of a weakly convex dominating set of G, while the convex domination number of a graph G is the minimum cardinality of a convex dominating set of G. In this paper we consider weakly convex and convex domination numbers of tori.     

Diameter and connectivity of 3-arc graphs

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v,u,x,y) of vertices such that both (v,u,x) and (u,x,y) are paths of length two. The 3-arc graph of a given graph G, X(G), is defined to have vertices the arcs of G. Two arcs uv,xy are adjacent in X(G) if and only if (v,u,x,y) is a 3-arc of G. This notion was introduced in recent studies of arc-transitive graphs. In this paper we study diameter and connectivity of 3-arc graphs. In particular, we obtain sharp bounds for the diameter and connectivity of X(G) in terms of the corresponding invariant of G.     

o-Boundedness of free topological groups

Assuming the absence of Q-points (which is consistent with ZFC) we prove that the free topological group F(X) over a Tychonov space X is o-bounded if and only if every continuous metrizable image T of X satisfies the selection principle fin_?(O,Ω) (the latter means that for every sequence 〈un〉_n∈ω of open covers of T there exists a sequence 〈vn〉_n∈ω such that vn∈[un]^<ω and for every F∈[X]^<ω there exists n∈ω with F⊂?vn). This characterization gives a consistent answer to a problem posed by C. Hernándes, D. Robbie, and M. Tkachenko in 2000.     

Finite-to-one maps into Euclidean manifolds and spaces with disjoint disks properties

It is shown that every Euclidean manifold M has the following property for any m?1: If f:X→Y is a perfect surjection between finite-dimensional metric spaces, then the mapping space C(X,M) with the source limitation topology contains a dense Gδ-subset of maps g such that dimBm(g)?mdimf+dimY−(m−1)dimM. Here, Bm(g)={(y,z)∈Y×M||f−1(y)∩g−1(z)|?m}. The existence of residual sets of finite-to-one maps into product of manifolds and spaces having disjoint disks properties is also obtained.     

Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs

A Steiner tree for a set S of vertices in a connected graph G is a connected subgraph of G with a smallest number of edges that contains S. The Steiner interval I(S) of S is the union of all the vertices of G that belong to some Steiner tree for S. If S={u,v}, then I(S)=I[u,v] is called the interval between u and v and consists of all vertices that lie on some shortest u-v path in G. The smallest cardinality of a set S of vertices such that ?_u,v∈SI[u,v]=V(G) is called the geodetic number and is denoted by g(G). The smallest cardinality of a set S of vertices of G such that I(S)=V(G) is called the Steiner geodetic number of G and is denoted by sg(G). We show that for distance-hereditary graphs g(G)?sg(G) but that g(G)/sg(G) can be arbitrarily large if G is not distance hereditary. An efficient algorithm for finding the Steiner interval for a set of vertices in a distance-hereditary graph is described and it is shown how contour vertices can be used in developing an efficient algorithm for finding the Steiner geodetic number of a distance-hereditary graph.     

Realcompactness of hyperspaces and extensions of open-closed maps

In response to questions of Ginsburg [9, 10], we prove that if cf(c)>ω₁, then there exists an open-closed, continuous map f from a normal, realcompact space X onto a space Y which is not realcompact. By his result the hyperspace 2^x of closed subsets of X is then not realcompact, and the extension μf(vf) of f to the topological completion (the Hewitt realcompactification) of X is not onto. The latter fact solves problems raised by Morita [16] and by Isiwata [12] both negatively. We also consider the problem whether or not the hyperspace of a hereditarily Lindelöf space is hereditarily realcompact.     

Distance-balanced graphs: Symmetry conditions

A graph X is said to be distance-balanced if for any edge uv of X, the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. A graph X is said to be strongly distance-balanced if for any edge uv of X and any integer k, the number of vertices at distance k from u and at distance k+1 from v is equal to the number of vertices at distance k+1 from u and at distance k from v. Exploring the connection between symmetry properties of graphs and the metric property of being (strongly) distance-balanced is the main theme of this article. That a vertex-transitive graph is necessarily strongly distance-balanced and thus also distance-balanced is an easy observation. With only a slight relaxation of the transitivity condition, the situation changes drastically: there are infinite families of semisymmetric graphs (that is, graphs which are edge-transitive, but not vertex-transitive) which are distance-balanced, but there are also infinite families of semisymmetric graphs which are not distance-balanced. Results on the distance-balanced property in product graphs prove helpful in obtaining these constructions. Finally, a complete classification of strongly distance-balanced graphs is given for the following infinite families of generalized Petersen graphs: GP(n,2), GP(5k+1,k), GP(3k±3,k), and GP(2k+2,k).     

Graphs with three mutually pseudo-similar vertices

Vertices u and v of a graph X are pseudo-similar if X ? u ? X ? v but no automorphism of X maps u to v. We describe a group-theoretic method for constructing graphs with a set of three mutually pseudo-similar vertices. The method is used to construct several examples of such graphs. An algorithm for extending, in a natural way, certain graphs with three mutually pseudo-similar vertices to a graph in which the three vertices are similar is given. The algorithm suggests that no simple characterization of graphs with a set of three mutually pseudo-similar vertices can exist.     

On iterates of fully closed absolutes

In this article we give a sufficient condition for a space X to have the fully closed absolute faX with the property fa(faX)=faX. An example of a compact space X such that the canonical mapping fa(α+1)X→fa(α)X (where α is a given ordinal) is not a homeomorphism is constructed. Also we give an example of a compact space X such that the canonical mapping faX→X is not a homeomorphism but for which there exists a homeomorphism faX→X.     

A note on similar edges and edge-unique line graphs

If G is a connected graph having no vertices of degree 2 and L(G) is its line graph, two results are proven: if there exist distinct edges e and f with L(G) ? e ? L(G) ? f then there is an automorphism of L(G) mapping e to f; if $\text{G ? u ¦ G ? v}$ for any distinct vertices u, v, then $\text{L(G) ? e ¦ L(G) ? f}$ for any distinct edges e, f.     

Hereditary invertible linear surjections and splitting problems for selections

Let A+B be the pointwise (Minkowski) sum of two convex subsets A and B of a Banach space. Is it true that every continuous mapping h:X→A+B splits into a sum h=f+g of continuous mappings f:X→A and g:X→B? We study this question within a wider framework of splitting techniques of continuous selections. Existence of splittings is guaranteed by hereditary invertibility of linear surjections between Banach spaces. Some affirmative and negative results on such invertibility with respect to an appropriate class of convex compacta are presented. As a corollary, a positive answer to the above question is obtained for strictly convex finite-dimensional precompact spaces.     

Products of straight spaces

A metric space X is straight if for each finite cover of X by closed sets, and for each real valued function f on X, if f is uniformly continuous on each set of the cover, then f is uniformly continuous on the whole of X. A locally connected space is straight iff it is uniformly locally connected (ULC). It is easily seen that ULC spaces are stable under finite products. On the other hand the product of two straight spaces is not necessarily straight. We prove that the product X×Y of two metric spaces is straight if and only if both X and Y are straight and one of the following conditions holds:

(a)

both X and Y are precompact;

(b)

both X and Y are locally connected;

(c)

one of the spaces is both precompact and locally connected.

In particular, when X satisfies (c), the product X×Z is straight for every straight space Z.Finally, we characterize when infinite products of metric spaces are ULC and we completely solve the problem of straightness of infinite products of ULC spaces.     

Ordinals and set-valued zero-selections for hyperspaces

A continuous zero-selection f for the Vietoris hyperspace F(X) of the nonempty closed subsets of a space X is a Vietoris continuous map f:F(X)→X which assigns to every nonempty closed subset an isolated point of it. It is well known that a compact space X has a continuous zero-selection if and only if it is an ordinal space, or, equivalently, if X can be mapped onto an ordinal space by a continuous one-to-one surjection. In this paper, we prove that a compact space X has an upper semi-continuous set-valued zero-selection for its Vietoris hyperspace F(X) if and only if X can be mapped onto an ordinal space by a continuous finite-to-one surjection.     

Radio number for trees

Let G be a connected graph with diameter diam(G). The radio number for G, denoted by rn(G), is the smallest integer k such that there exists a function f:V(G)→{0,1,2,…,k} with the following satisfied for all vertices u and v: |f(u)-f(v)|?diam(G)-d_G(u,v)+1, where d_G(u,v) is the distance between u and v. We prove a lower bound for the radio number of trees, and characterize the trees achieving this bound. Moreover, we prove another lower bound for the radio number of spiders (trees with at most one vertex of degree more than two) and characterize the spiders achieving this bound. Our results generalize the radio number for paths obtained by Liu and Zhu.