Every scattered space is subcompact

We prove that every scattered space is hereditarily subcompact and any finite union of subcompact spaces is subcompact. It is a long-standing open problem whether every ?ech-complete space is subcompact. Moreover, it is not even known whether the complement of every countable subset of a compact space is subcompact. We prove that this is the case for linearly ordered compact spaces as well as for ω  -monolithic compact spaces. We also establish a general result for Tychonoff products of discrete spaces which implies that dense _Gδ$G_{\delta }$-subsets of Cantor cubes are subcompact.     

Spaces in which every dense subset is a Gδ

A topological space X is called a DG_δ-space if every subset of X is a G_δ-set in its closure. In this paper we study DG_δ-spaces that contains subspaces in which every dense subset is open and spaces in which every subset is a G_δ . We give some new results in these classes of topological spaces.     

Unified characterizations for modifications ofR 0 andR 1 topological spaces

Cammaroto and Noiri [14] introduced a separation axiom calledm-R ₀ in anm-space (X, m). In this paper, we introduce the notion ofm-R ₁ spaces and offer many characterizations ofm-R ₀ (resp.m-R ₁) spaces which enable us to obtain unified characterizations of separation axiomsR ₀, semi-R ₀, pre-R ₀,α-R ₀,δ-semiR ₀, (δ, p)-R ₀ (resp.R ₁, semi-R ₁, pre-R ₁,α-R ₁,δ-semiR ₁, (δ, p)-R ₁).     

The roots of <Emphasis Type="Italic">σ</Emphasis>-polynomials

Let G be a connected graph. We denote by σ(G,x) and δ(G) respectively the σ-polynomial and the edge-density of G, where . If σ(G,x) has at least an unreal root, then G is said to be a σ-unreal graph. Let δ(n) be the minimum edgedensity over all n vertices graphs with σ-unreal roots. In this paper, by using the theory of adjoint polynomials, a negative answer to a problem posed by Brenti et al. is given and the following results are obtained: For any positive integer a and rational number 0≤c≤1, there exists at least a graph sequence {G _i}_1≤i≤a such that G _i is σ-unreal and δ(G _i)→c as n→∞ for all 1 ≤i≤a, and moreover, δ(n)→0 as n→∞. Supported by the National Natural Science Foundation of China (10061003) and the Science Foundation of the State Education Ministry of China.     

A Banach space where minimal weak cuscos are generically compact-valued

The space of continuous functions on the double arrow space has long been of interest in differentiability theory since many convex functions on this space are densely but not generically Gâteaux differentiable. We show that this space has the property that minimal weak* cuscos into its dual take compact values at the points of a denseG set.     

Hyperspaces of nowhere topologically complete spaces

It is proved that ifX is a connected locally continuumwise connected coanalytic nowhere topologically complete space, then the hyperspace 2 ^X of all nonempty compact subsets ofX is strongly universal in the class of all coanalytic spaces. Moreover, 2 ^X is homeomorphic to Π₂ ifX is a Baire space, and toQ∖Π₁ ifX contains a dense absoluteG _δ-setG ⊂X such that the intersectionG ∩U is connected for any open connectedU ⊂X. (Here Π₁, Π₁⊂X are the standard subsets of the Hilbert cubeQ absorbing for the classes of analytic and coanalytic spaces, respectively.) Similar results are obtained for higher projective classes. Translated fromMatematicheskie Zametki, Vol. 62, No. 1, pp. 35–51, July, 1997. Translated by O. V. Sipacheva     

On the product of homogeneous spaces

Within the class of Tychonoff spaces, and within the class of topological groups, most of the natural questions concerning ‘productive closure’ of the subclasses of countably compact and pseudocompact spaces are answered by the following three well-known results: (1) [ZFC] There is a countably compact Tychonoff space X such that X × X is not pseudocompact; (2) [ZFC] The product of any set of pseudocompact topological groups is pseudocompact; and (3) [ZFC+ MA] There are countably compact topological groups G₀, G₁ such that G₀ × G₁ is not countably compact.In this paper we consider the question of ‘productive closure” in the intermediate class of homogeneous spaces. Our principal result, whose proof leans heavily on a simple, elegant result of V.V. Uspenski?, is this: In ZFC there are pseudocompact, homogeneous spaces X₀, X₁ such that X₀ × X₁ is not pseudocompact; if in addition MA is assumed, the spaces X_i may be chosen countably compact.Our construction yields an unexpected corollary in a different direction: Every compact space embeds as a retract in a countably compact, homogeneous space. Thus for every cardinal number α there is a countably compact, homogeneous space whose Souslin number exceeds α.     

A new look at some classical theorems on continuous functions on normal spaces

A sufficient condition for the strict insertion of a continuous function between two comparable upper and lower semicontinuous functions on a normal space is given. Among immediate corollaries are the classical insertion theorems of Michael and Dowker. Our insertion lemma also provides purely topological proofs of some standard results on closed subsets of normal spaces which normally depend upon uniform convergence of series of continuous functions. We also establish a Tietze-type extension theorem characterizing closed G _δ -sets in a normal space. This research was supported by the Ministry of Education and Science of Spain and FEDER under grant MTM2006-14925-C02-02. The first named author also acknowledges financial support from the University of the Basque Country under grant UPV05/101.     

Open mappings looking like projections

Every open continuous mappingf from a metric space (X, d) onto a countable-dimensional metric spaceY admits a special type of factorization (Y×[0, 1] throughout), provided all fibers off are dense in itself and complete with respect tod. On this basis, an upper semi-continuous Cantor bouquet of disjoint usco selections for a class of 1.s.c. mappings between metrizable spaces is constructed.     

A construction of two distinct canonical sets of lifts of Brauer characters of a p-solvable group

In [5], Navarro defines the set , where Q is a p-subgroup of a p-solvable group G, and shows that if δ is the trivial character of Q, then Irr(G|Q, δ) provides a set of canonical lifts of IBr_p(G), the irreducible Brauer characters with vertex Q. Previously, in [2], Isaacs defined a canonical set of lifts B_π(G) of I_π(G). Both of these results extend the Fong-Swan Theorem to π-separable groups, and both construct canonical sets of lifts of the generalized Brauer characters. It is known that in the case that 2∈π, or if |G| is odd, we have B_π(G) = Irr(G|Q, 1_Q). In this note we give a counterexample to show that this is not the case when . It is known that if and χ∈B_π(G), then the constituents of χ_N are in B_π (N). However, we use the same counterexample to show that if , and χ∈Irr(G|Q, 1_Q) is such that θ ∈Irr(N) and [θ, χ _N] ≠ 0, then it is not necessarily the case that θ ∈Irr(N) inherits this property. Received: 17 October 2005     

The intrinsic dimensionality of graphs

We resolve the following conjecture raised by Levin together with Linial, London, and Rabinovich [Combinatorica, 1995]. For a graph G, let dim(G) be the smallest d such that G occurs as a (not necessarily induced) subgraph of ℤ_∞ ^d , the infinite graph with vertex set ℤ ^d and an edge (u, v) whenever ∥u − v∥_∞ = 1. The growth rate of G, denoted ρ _G , is the minimum ρ such that every ball of radius r > 1 in G contains at most r ^ρ vertices. By simple volume arguments, dim(G) = Ω(ρ _G ). Levin conjectured that this lower bound is tight, i.e., that dim(G) = O(ρ _G ) for every graph G. Previously, it was unknown whether dim(G) could be bounded above by any function of ρ _G . We show that a weaker form of Levin’s conjecture holds by proving that dim(G) = O(ρ _G log ρ _G ) for any graph G. We disprove, however, the specific bound of the conjecture and show that our upper bound is tight by exhibiting graphs for which dim(G) = Ω(ρ _G log ρ _G ). For several special families of graphs (e.g., planar graphs), we salvage the strong form, showing that dim(G) = O(ρ _G ). Our results extend to a variant of the conjecture for finite-dimensional Euclidean spaces posed by Linial and independently by Benjamini and Schramm. Supported by NSF grant CCR-0121555 and by an NSF Graduate Research Fellowship.     

Extensions by Means of Expansions and Selections

We provide proper mapping-characterizations of some embedding-like properties weaker than -embedding. For instance, we show that a subset A of a space X is -embedded in X if and only if for every continuous map g: A → Y into a Banach space Y of weight w(Y) ⩽ λ, there exists a continuous set-valued mapping φ of X into the nonempty compact subsets of Y such that g is a selection for φ∣A (i.e., g(x) ∈ φ(x) for every x ∈ A). On the other hand, we show that a subset A is C*-embedded in X if and only if for every continuous set-valued mapping φ of X into the non-empty compact subsets of a Banach space Y, every continuous selection g: A → Y for φ∣A is continuously extendable to the whole of X. Combining both results we get the well-known mapping-characterization of -embedding which makes more transparent the relation ‘’. Other weak components of -embedding are described in terms of expansions and selections, possible applications are demonstrated as well.     

On the improperness sets of families of linear differential systems

We consider families of linear differential systems continuously depending on a real parameter with continuous (or piecewise continuous) coefficients on the half-line. The improperness set of such a family is defined as the set of all parameter values for which the corresponding systems in the family are Lyapunov improper. We show that a subset of the real axis is the improperness set of some family if and only if it is a G _δσ -set. The result remains valid for families in which the matrices of the systems are bounded on the half-line. Almost the same result holds for families in which the parameter occurs only as a factor multiplying the system matrix: their improperness sets are the G _δσ -sets not containing zero. For families of the last kind with bounded coefficient matrix, we show that their improperness set is an arbitrary open subset of the real line.     

On hamiltonicity of <Emphasis Type="Italic">P</Emphasis><Subscript>3</Subscript>-dominated graphs

We introduce a new class of graphs which we call P ₃-dominated graphs. This class properly contains all quasi-claw-free graphs, and hence all claw-free graphs. Let G be a 2-connected P ₃-dominated graph. We prove that G is hamiltonian if α(G ²) ≤ κ(G), with two exceptions: K _2,3 and K _1,1,3. We also prove that G is hamiltonian, if G is 3-connected and |V(G)| ≤ 5δ(G) − 5. These results extend known results on (quasi-)claw-free graphs. This paper was completed when both authors visited the Center for Combinatorics, Nankai University, Tianjin. They gratefully acknowledge the hospitality and support of the Center for Combinatorics and Nankai University. The work of E.Vumar is sponsored by SRF for ROCS, REM.     

Lifting paths on quotient spaces

Let X be a compactum and G an upper semi-continuous decomposition of X such that each element of G is the continuous image of an ordered compactum. If the quotient space X/G is the continuous image of an ordered compactum, under what conditions is X also the continuous image of an ordered compactum? Examples around the (non-metric) Hahn-Mazurkiewicz Theorem show that one must place severe conditions on G if one wishes to obtain positive results. We prove that the compactum X is the image of an ordered compactum when each g∈G has 0-dimensional boundary. We also consider the case when G has only countably many non-degenerate elements. These results extend earlier work of the first named author in a number of ways.     

Path extendable graphs

A pathP in a graphG is said to beextendable if there exists a pathP’ inG with the same endvertices asP such thatV(P)⊆V (P’) and |V(P’)|=|V(P)|+1. A graphG ispath extendable if every nonhamiltonian path inG is extendable. We investigate the extent to which known sufficient conditions for a graph to be hamiltonian-connected imply the extendability of paths in the graph. Several theorems are proved: for example, it is shown that ifG is a graph of orderp in which the degree sum of each pair of non-adjacent vertices is at leastp+1 andP is a nonextendable path of orderk inG thenk≤(p+1)/2 and 〈V (P)〉≅K _k orK _k −e. As corollaries of this we deduce that if δ(G)≥(p+2)/2 or if the degree sum of each pair of nonadjacent vertices inG is at least (3p−3)/2 thenG is path extendable, which strengthen results of Williamson [13].     

Notes on paratopological groups

In this paper, we prove that if a remainder of a non-locally compact paratopological group G   has a _Gδ$G_{\delta }$-diagonal and every compact subset of G is first countable, then G   has a _Gδ$G_{\delta }$-diagonal of infinite rank. This improves a result of Chuan Liu and Shou Lin [Chuan Liu, Shou Lin, Generalized metric spaces with algebraic structure, Topology Appl. 157 (2010) 1966–1974]. We also construct an open continuous homomorphism f from a non-metrizable paratopological group G onto a metrizable topological group H such that the kernel of f is metrizable. This result gives a negative answer to an open problem posed in [A.V. Arhangel?skii, M. Tkachenko, Topological Groups and Related Structures, Atlantis Press, World Scientific, 2008].     

Gromov hyperbolic cubic graphs

If X is a geodesic metric space and x ₁; x ₂; x ₃ ∈ X, a geodesic triangle T = {x ₁; x ₂; x ₃} is the union of the three geodesics [x ₁ x ₂], [x ₂ x ₃] and [x ₃ x ₁] in X. The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X. We denote by δ(X) the sharp hyperbolicity constant of X, i.e., δ(X) = inf {δ ≥ 0: X is δ-hyperbolic}. We obtain information about the hyperbolicity constant of cubic graphs (graphs with all of their vertices of degree 3), and prove that for any graph G with bounded degree there exists a cubic graph G* such that G is hyperbolic if and only if G* is hyperbolic. Moreover, we prove that for any cubic graph G with n vertices, we have δ(G) ≤ min {3n/16 + 1; n/4}. We characterize the cubic graphs G with δ(G) ≤ 1. Besides, we prove some inequalities involving the hyperbolicity constant and other parameters for cubic graphs.     

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.     

Note on hit-and-miss topologies

This is a continuation of [19]. We characterize first and second countability of the general hit-and-miss hyperspace topologyτ ₊ ^Δ for weakly-R ₀ base spaces. Further, metrizability ofτ ₊ ^Δ is characterized with no preliminary conditions on the base space and the generating family of closed sets and a new proof on uniformizability (i.e. complete regularity) ofτ ₊ ^Δ is given in this general setting, thus generalizing results of [3], [5] and [6].