Weakly compact composition operators on vector-valued BMOA

Weak compactness of the analytic composition operator f?f○φ is studied on BMOA(X), the space of X-valued analytic functions of bounded mean oscillation, and its subspace VMOA(X), where X is a complex Banach space. It is shown that the composition operator is weakly compact on BMOA(X) if X is reflexive and the corresponding composition operator is compact on the scalar-valued BMOA. A concrete example is given which shows that BMOA(X) differs from the weak vector-valued BMOA for infinite dimensional Banach spaces X.     

Modules whose hereditary pretorsion classes are closed under products

A module M is called product closed if every hereditary pretorsion class in σ[M] is closed under products in σ[M]. Every module M which is locally of finite length (every finitely generated submodule of M has finite length) is product closed and every product closed module M is semilocal (M/J(M) is semisimple). Let be product closed and projective in σ[M]. It is shown that (1) M is semiartinian; (2) if M is finitely generated then M satisfies the DCC on fully invariant submodules; (3) M has finite length if M is finitely generated and every hereditary pretorsion class in σ[M] is M-dominated. If the ring R is commutative it is proven that M is product closed if and only if M is locally of finite length.     

The centralizer of a semi-linear transformation

Let V be a finite-dimensional vector space over a division ring D, where D is finite-dimensional over its center F. Suppose T is a semi-linear transformation on V with associated automorphism σ of D. The centralizer of T is the ring C(T) of all linear transformations on V which commute with T. If σ^r is the identity on D for some r ? 1 and no smaller positive power of σ is an inner automorphism, then the center of C(T) is computed to be polynomials in T^r with coefficients from F₀, where F₀ is the subfield of F left elementwise fixed by σ. A matrix version of this theorem is also given.     

A Sharp Bound for the Marginal Appendage Number

For a connected graph G, the distance d(u, v) between two vertices u and v is the length of a shortest u − v path in G and the distance d(v) of a vertex v is the sum of the distances between v and all vertices of G. The margin, μ (G), is the subgraph induced by vertices of G having the maximum distance. It is known that every graph is isomorphic to the margin of some graph H. For a graph G, the marginal appendage number is defined as min{p(H) − p(G) ∣ μ(H) = G}. In this paper it is shown that Δ (G) + 2 is a sharp bound for the marginal appendage number.     

On normal τ-measurable operators affiliated with semifinite von Neumann algebras

Let τ be a faithful normal semifinite trace on the von Neumann algebra M, 1 ≥ q > 0. The following generalizations of problems 163 and 139 from the book [1] to τ-measurable operators are obtained; it is established that: 1) each τ-compact q-hyponormal operator is normal; 2) if a τ-measurable operator A is normal and, for some natural number n, the operator A ⁿ is τ-compact, then the operator A is also τ-compact. It is proved that if a τ-measurable operator A is hyponormal and the operator A ² is τ-compact, then the operator A is also τ-compact. A new property of a nonincreasing rearrangement of the product of hyponormal and cohyponormal τ-measurable operators is established. For normal τ-measurable operators A and B, it is shown that the nonincreasing rearrangements of the operators AB and BA coincide. Applications of the results obtained to F-normed symmetric spaces on (M, τ) are considered.     

The influence of minimal subgroups of focal subgroups on the structure of finite groups

A subgroup H of a finite group G is said to be complemented in G if there exists a subgroup K of G such that G=HK and H∩K=1. In this paper, it is proved that a finite group G is p-nilpotent provided p is the smallest prime number dividing the order of G and every minimal subgroup of the p-focal subgroup of G is complemented in N_G(P), where P is a Sylow p-subgroup of G. As some applications, some interesting results related with complemented minimal subgroups of focal subgroups are obtained.     

Domination by second countable spaces and Lindelöf Σ-property

Given a space M, a family of sets A of a space X is ordered by M if A={AK:K is a compact subset of M} and K⊂L implies AK⊂AL. We study the class M of spaces which have compact covers ordered by a second countable space. We prove that a space Cp(X) belongs to M if and only if it is a Lindelöf Σ-space. Under MA(ω₁), if X is compact and (X×X)\Δ has a compact cover ordered by a Polish space then X is metrizable; here Δ={(x,x):x∈X} is the diagonal of the space X. Besides, if X is a compact space of countable tightness and X²\Δ belongs to M then X is metrizable in ZFC.We also consider the class M^? of spaces X which have a compact cover F ordered by a second countable space with the additional property that, for every compact set P⊂X there exists F∈F with P⊂F. It is a ZFC result that if X is a compact space and (X×X)\Δ belongs to M^? then X is metrizable. We also establish that, under CH, if X is compact and Cp(X) belongs to M^? then X is countable.     

A finiteness theorem for primal extensions

A set W⊆V(G) is called homogeneous in a graph G if 2?|W|?|V(G)|-1, and N(x)?W=N(y)?W for each x,y∈W. A graph without homogeneous sets is called prime. A graph H is called a (primal) extension of a graph G if G is an induced subgraph of H, and H is a prime graph. An extension H of G is minimal if there are no extensions of G in the set ISub(H)?{H}. We denote by Ext(G) the set of all minimal extensions of a graph G.We investigate the following problem: find conditions under which Ext(G) is a finite set. The main result of Giakoumakis (Discrete Math. 177 (1997) 83-97) is the following sufficient condition.

Theorem. If every homogeneous set of G has exactly two vertices thenExt(G)is a finite set.     

Doubling measures on Whitney modification sets

A Whitney modification set in R is a set of the form E∪F(W), where E is a nonempty closed set in R, W is a Whitney decomposition of R?E, and F(W) consists of centers of intervals in W. We prove that a measure on a Whitney modification set is doubling if and only if it is the Whitney modification of a doubling measure on R.     

Geodeticity of the contour of chordal graphs

A vertex v is a boundary vertex of a connected graph G if there exists a vertex u such that no neighbor of v is further away from u than v. Moreover, if no vertex in the whole graph V(G) is further away from u than v, then v is called an eccentric vertex of G. A vertex v belongs to the contour of G if no neighbor of v has an eccentricity greater than the eccentricity of v. Furthermore, if no vertex in the whole graph V(G) has an eccentricity greater than the eccentricity of v, then v is called a peripheral vertex of G. This paper is devoted to study these kinds of vertices for the family of chordal graphs. Our main contributions are, firstly, obtaining a realization theorem involving the cardinalities of the periphery, the contour, the eccentric subgraph and the boundary, and secondly, proving both that the contour of every chordal graph is geodetic and that this statement is not true for every perfect graph.     

On van der Waerden's theorem and the theorem of Paris and Harrington

A 2-coloring of the non-negative integers and a function h are given such that if P is any monochromatic arithmetic progression with first term a and common difference d then 6P6 ? h(a) and 6P6 ? h(d). In contrast to this the following result is noted. For any k, f there is n = n(k, f) such that whenever n is k-colored there is a monochromatic subset A of n with 6A6 > f(d), where d is the maximum of the differences between consecutive elements of A.     

Classifying Hilbert bundles

A Hilbert bundle (p, B, X) is a type of fibre space p:B → X such that each fibre p^?1(x) is a Hilbert space. However, p^?1(x) may vary in dimension as x varies in X. We generalize the classical homotopy classification theory of vector bundles to a “homotopy” classification of certain Hilbert bundles. An (m, n)-bundle over the pair (X, A) is a Hilbert bundle (p, B, X) such that the dimension of p^?1(x) is m for x in A and n otherwise. The main result here is that if A is a compact set lying in the “edge” of the metric space X (e.g. if X is a topological manifold and A is a compact subset of the boundary of X), then the problem of classifying (m, n)-bundles over (X, A) reduces to a problem in the classical theory of vector bundles. In particular, we show there is a one-to-one correspondence between the members of the orbit set, [A, G_m($\text{C}$ⁿ)]/[X, U(n)] ¦ A, and the isomorphism classes of (m, n)-bundles over (X, A) which are trivial over X, A.     

Characterization of eccentric digraphs

The eccentric digraphED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being ‘eccentric’; that is, there is an arc from u to v in ED(G) if and only if v is at maximum distance from u in G. A digraph G is said to be eccentric if there exists a digraph H such that G=ED(H). This paper is devoted to the study of the following two questions: what digraphs are eccentric and when the relation of being eccentric is symmetric.We present a characterization of eccentric digraphs, which in the undirected case says that a graph G is eccentric iff its complement graph is either self-centered of radius two or it is the union of complete graphs. As a consequence, we obtain that all trees except those with diameter 3 are eccentric digraphs. We also determine when ED(G) is symmetric in the cases when G is a graph or a digraph that is not strongly connected.     

When is G 2 a König–Egerváry Graph?

The independence number of a graph G, denoted by α(G), is the cardinality of a maximum independent set, and μ(G) is the size of a maximum matching in G. If α(G) + μ(G) equals its order, then G is a König–Egerváry graph. The square of a graph G is the graph G ² with the same vertex set as in G, and an edge of G ² is joining two distinct vertices, whenever the distance between them in G is at most two. G is a square-stable graph if it enjoys the property α(G) = α(G ²). In this paper we show that G ² is a König–Egerváry graph if and only if G is a square-stable König–Egerváry graph.     

The strong metric dimension of graphs and digraphs

Let G be a connected (di)graph. A vertex w is said to strongly resolve a pair u,v of vertices of G if there exists some shortest u-w path containing v or some shortest v-w path containing u. A set W of vertices is a strong resolving set for G if every pair of vertices of G is strongly resolved by some vertex of W. The smallest cardinality of a strong resolving set for G is called the strong dimension of G. It is shown that the problem of finding the strong dimension of a connected graph can be transformed to the problem of finding the vertex covering number of a graph. Moreover, it is shown that computing this invariant is NP-hard. Related invariants for directed graphs are defined and studied.     

On a conjecture of E. Rapaport Strasser about knot-like groups and its pro-p version

A group G is knot-like if it is finitely presented of deficiency 1 and has abelianization G/G^′?Z. We prove the conjecture of E. Rapaport Strasser that if a knot-like group G has a finitely generated commutator subgroup G^′ then G^′ should be free in the special case when the commutator G^′ is residually finite. It is a corollary of a much more general result : if G is a discrete group of geometric dimension n with a finite K(G,1)-complex Y of dimension n, Y has Euler characteristics 0, N is a normal residually finite subgroup of G, N is of homological type FP_n-1 and G/N?Z then N is of homological type FP_n and hence G/N has finite virtual cohomological dimension vcd(G/N)=cd(G)-cd(N). In particular either N has finite index in G or cd(N)?cd(G)-1.Furthermore we show a pro-p version of the above result with the weaker assumption that G/N is a pro-p group of finite rank. Consequently a pro-p version of Rapaport's conjecture holds.     

Convex Partitions of Graphs

A set of vertices S of a graph G is convex if all vertices of every geodesic between two of its vertices are in S. We say that G is k-convex if V(G) can be partitioned into k convex sets. The convex partition number of G is the least k ⩾ 2 for which G is k-convex. In this paper we examine k-convexity of graphs. We show that it is NP-complete to decide if G is k-convex, for any fixed k ⩾ 2. We describe a characterization for k-convex cographs, leading to a polynomial time algorithm to recognize if a cograph is k-convex. Finally, we discuss k-convexity for disconnected graphs.     

Longest cycles in r-regular r-connected graphs

Let r ≥ 3 be an integer, and ε > 0 a real number. It is shown that there is an integer N(r, ε) such that for all n ≥ N (if r is even) or for all even n ≥ N (if r is odd), there is an r-connected regular graph of valency r on exactly n vertices whose longest cycles have fewer than εn vertices. That is, the number ε > 0, no matter how small, is a “shortness coefficient” for the family of r-valent regular r-connected graphs.     

Henriksen?s contributions to residue class rings of analytic and entire functions

The author surveys, summarizes and generalizes results of Golasiński and Henriksen, and of others, concerning certain residue class rings.Let A(R) denote the ring of analytic functions over reals R and E(K) the ring of entire functions over R or complex numbers C. It is shown that if m is a maximal ideal of A(R), then A(R)/m is isomorphic either to the reals or a real-closed field that is η₁-set, while if m is a maximal ideal of E(K), then E(K)/m is isomorphic to one of these latter two fields or to complex numbers.     

The group marriage problem

Let G be a permutation group acting on [n]={1,…,n} and V={Vi:i=1,…,n} be a system of n subsets of [n]. When is there an element g∈G so that g(i)∈Vi for each i∈[n]? If such a g exists, we say that G has a G-marriage subject to V. An obvious necessary condition is the orbit condition: for any nonempty subset Y of [n], there is an element g∈G such that the image of Y under g is contained in _?y∈YVy. Keevash observed that the orbit condition is sufficient when G is the symmetric group Sn; this is in fact equivalent to the celebrated Hall's Marriage Theorem. We prove that the orbit condition is sufficient if and only if G is a direct product of symmetric groups. We extend the notion of orbit condition to that of k-orbit condition and prove that if G is the cyclic group Cn where n?4 or G acts 2-transitively on [n], then G satisfies the (n−1)-orbit condition subject to V if and only if G has a G-marriage subject to V.