A holomorphic map ψ of the unit disk ito itself induces an operator Cψ on holomorphic functions by composition. We characterize bounded and compact composition operators Cψ on Qp spaces, which coincide with the BMOA for p = 1 and Bloch spaces for p > 1. We also give boundedness and compactness characterizations of Cψ from analytic function space X to Qp spaces, X = Dirichlet space D, Bloch space B or B0 = {f: f′ ∈ H∞}.

A group G is called normally (subnormally) detectable if the only normal (subnormal) subgroups in any direct product G1 × … × Gn of copies of G are just the direct factors Gi. We give an internal characterization of finite subnormally detectable groups and obtain analogous results for associative rings and for Lie algebras. The main part of the paper deals with a study of normally detectable groups, where we verify a conjecture of T. O. Hawkes in a number of special cases.

Let $P$ be a finitely generated cancellative abelian monoid. A $P$-graph ${\rm\Lambda}$ is a natural generalization of a $k$-graph. A pullback of ${\rm\Lambda}$ is constructed by pulling it back over a given monoid morphism to $P$, while a pushout of ${\rm\Lambda}$ is obtained by modding out its periodicity, which is deduced from a natural equivalence relation on ${\rm\Lambda}$. One of our main results in this paper shows that, for some $k$-graphs ${\rm\Lambda}$, ${\rm\Lambda}$ is isomorphic to the pullback of its pushout via a natural quotient map, and that its graph $\text{C}^{\ast }$-algebra can be embedded into the tensor product of the graph $\text{C}^{\ast }$-algebra of its pushout and $\text{C}^{\ast }(\text{Per}\,{\rm\Lambda})$. As a consequence, in this case, the cycline algebra generated by the standard generators corresponding to equivalent pairs is a maximal abelian subalgebra, and there is a faithful conditional expectation from the graph $\text{C}^{\ast }$-algebra onto it.

We show that for any self-consistent sequentially maximal system {μα} of infinite (perhaps non-σ-finite) Radon measures, the projective limit of {μα} exists.

We show that diagrammatically reducible two-complexes are characterized by the property: every finity subconmplex of the universal cover collapses to a one-complex. We use this to show that a compact orientable three-manifold with nonempty boundary is Haken if and only if it has a diagrammatically reducible spine. We also formulate an nanlogue of diagrammatic reducibility for higher dimensional complexes. Like Haken three-manifolds, we observe that if n ≥ 4 and M is compact connected n-dimensional manifold with a traingulation, or a spine, satisfying this property, then the interior of the universal cover of M is homeomorphic to Euclidean n-space.

We prove that there is no algorithm to determine when an amalgam of finite rings (or semigroups) can be embedded in the class of rings or in the class of finite rings (respectively, in the class of semigroups or in the class of finite semigroups). These results are in marked contrast with the corresponding problems for groups where every amalgam of finite groups can be embedded in a finite group.

Let k be an algebraically closed field of characteristic p, and G a finite group. Let M be an indecomposable kG-module with vertex V and source X, and let P be a Sylow p-subgroup of G containing V. Theorem: If dimkX is prime to p and if NG(V) is p-solvable, then the p-part of dimkM equals [P:V]; dimkX is prime to p if V is cyclic.

Let F be a field of characteristic p and G a group containing at least one element of order p. It is proved that the group of units of the group algebra FG is a bounded Engel group if and only if FG is a bounded Engel algebra, and that this is the case if and only if G is nilpotent and has a normal subgroup H such that both the factor group G/H and the commutator subgroup H′ are finite p–groups.

A positive quadratic form , of determinant and minimum M for integral , is said to be extreme if the ratio is a (local) maximum for small variations in the coefficients .

Minkowski [3] has given a criterion for extreme forms in terms of a fundamental region (polyhedral cone) in the coefficient space. This criterion, however, involves a complete knowledge of the edges of the region and is therefore of only theoretical value.

In this paper priority queues with K classes of customers with a preemptive repeat and a preemptive resume policy are considered. Customers arrive in independent Poisson processes, are served, within classes, in order of arrival, and have general requirements for service. Transforms of stationary waiting time and queue size distributions and busy period distributions are obtained for individual classes and for the system; the moments of the distributions are considered.

We give a revised and updated exposition of the theory of full dualities initiated by Clark, Davey, Krauss and Werner, introducing the (stronger) notion of a strong duality. All known full dualities turn out to be strong. A series of theorems which provide necessary and sufficient conditions for a strong duality to exist is proved. All full dualities in the literature can be obtained from these results and many new strong dualities can be derived. In particular, we show that within congruence distributive varieties every duality can be upgraded to a strong duality. Amongst the new strong dualities are the dualities of Davey, Priestley and Werner for the varieties of pseudocomplemented distributive lattices which are either strong as they stand or can easily be made strong by the addition of partial operations to the dual structures.

A group which is minimally generated by n generators and defined by n relations is said to have zero deficiency. The class of finite groups known to have zero deficiency is small, consisting of cyclic groups, certain metacyclic groups [4] and classes of groups given in [1], [2] and [3].

A.H. Clifford ([2], [3]) has shown that all finite dimensional irreducible representations of a completely 0-simple semigroup can be obtained as extensions of those of its maximal subgroups. Lallement and Petrich, [7], have given an alternative method for constructing the irreducible representations of a finite 0-simple semigroup from its Schutzenberger representation ([13]). Using the form which they obtain for the irreducible representations of a finite 0-simple semigroup S = M0(G; m, n; P), Lallement and Petrich show that where M is the Munn algebra isomorphic to the (contracted) algebra Φ(S) of S over Φ.

In this paper, we propose a matrix-variate generalization of the Gauss hypergeometric distribution and study several of its properties. We also derive probability density functions of the product of two independent random matrices when one of them is Gauss hypergeometric. These densities are expressed in terms of Appell’s first hypergeometric function F1 and Humbert’s confluent hypergeometric function Φ1of matrix arguments.

Let C be a small category with weak finite limits, and let Flat(C) be the category of flat functors from C to the category of small sets. We prove that the free exact completion of C is the category of set-valued functors of Flat (C) which preserve small products and filtered colimits. In case C has finite limits, this gives A. Carboni and R. C. Magno's result on the free exact completion of a small category with finite limits.

Let X be a completely regular Hausdorff space, let V be a system of weights on X and let T be a locally convex Hausdorff topological vector space. Then CVb(X, T) is a locally convex space of vector-valued continuous functions with a topology generated by seminorms which are weighted analogues of the supremum norm. In the present paper we characterize multiplication operators on the space CVb(X, T) induced by operator-valued mappings and then obtain a (linear) dynamical system on this weighted function space.

Necessary and sufficient optimality conditions of Kuhn-Tucker type for a convex programming problem with subdifferentiable operator constraints have been obtained. A duality theorem of Wolfe's type has been derived. Assuming that the objective function is strictly convex, a converse duality theorem is obtained. The results are then applied to a programming problem in which the objective function is the sum of a positively homogeneous, lower-semi-continuous, convex function and a continuous convex function.

The qualitative behaviour of control systems based on ordinary differential equations has been investigated with clarity and elegance using axiomatically defined General Control Systems. Here an attainablity set function, evolving in semigroup fashion, is the main entity of interest [1], [2], [3], [4].

Among all possible semiregular continued fraction expansions of an irrational number the one with the best approximation properties, in a well-defined and natural sense, is determined. Some properties of this so called optimal continued fraction expansion are described.

A new basis for discrete analytic polynomials is presented for which the series converges absolutely to a discrete analytic function in the upper right quarter lattice whenever