For an operator on a Hilbert space, points in the closure of its numerical range are characterized as either extreme, non-extreme boundary, or interior in terms of various associated sets of bounded sequences of vectors. These generalize similar results due to Embry, for points in the numerical range.

Methods from the theory of orthogonal polynomials are extended to L-polynomials . By this means the authors and W. B. Jones (J. Math. Anal. Appl. 98 (1984), 528–554) solved the strong Hamburger moment problem, that is, given a double sequence , to find a distribution function ψ(t), non-decreasing, with an infinitenumber of points of increase and bounded on −∞ < t < ∞, such that for all integers . In this article further menthods such as analogues of the Lioville-Ostrogradski formula and of the Christoffel-Darboux formula are developed to investigated When the moment porblem has a unique solution. This will be the case if and only if a sequence of nested disks associated with the sequence has only a point as its intersection (the so called limit point case).

Representations of non-type I groups G which may be expressed as an increasing union of type I normal subgroups are considered. Groups with this structure are natural generalisations of the CAR algebra (viewed as a twisted group C*-algebra) and are also group theoretic analogues of AF algebras. This paper gives a systematic account of their representation theory based on a canonical construction of one-cocycles for the G-action on the dual of a normal subgroup. Some examples are considered showing how to construct inquivalent irreducible representations (non-cohomologous cocycles) and also factor representations by a method which generalises the well-known construction of non-isomorphic factors for the CAR algebra.

The role played by the Möbius function of the lattice of all partitions of a set in the theory of k-statistics and their generalisations is pointer out and the main results conscerning these statistics are drived. The definitions and formulae for the expansion of products of generalished k-statistics are presented from this viewpoint and applied to arrays of random variables whos moments satisfy stitable symmentry constraints. Applications of the theory are given including the calculation of (joint) cumulants of k-statistics, the minimum variace estimation of (generalised) moments and the asymptotic behaviour of generalised k-statistics viewed as (reversed) martingales.

In this paper the class of rings for which the right flat modules form the torsion-free class of a hereditary torsion theory (G, ℱ) are characterized and their structure investigated. These rings are called extended semihereditary rings. It is shown that the class of regular rings with ring homomorphism is a full co-reflective subcategory of the class of extended semihereditary rings with “flat” homomorphisms. A class of prime torsion theories is introduced which determines the torsion theory (G, ℱG). The torsion theory (JG, ℱG) is used to find a suitable generalisation of Dedekind Domain.

We study the heat equation on a homogeneous bundle over a compact Lie group. The trace of the heat kernel is explicitly calculated. By comparing this with the formula constructed form the eigenvalues (with multiplicities) of the Laplacian we obtain and unusual formula involving the Clebsch-Gordan numbers. The main method is to use invariance under conjugation to pass from the group to its maximal torus, where a direct calculation can be carried out.

Let G be a group acting faithfully on a homogeneous tree of order p + 1, p > 1. Let be the space of functions on the Poission boundary ω, of zero mean on ω. When p is a prime. G is a discrete subgroup of PGL2(Qp) of finite covolume. The representations of the special series of PGL2(Qp), Which are irreducible and unitary in an appropriate completion of , are shown to be reducible when restricted to G. It is proved that these representations of G are algebraically reducible on and topologically irreducible on endowed with the week topology.

In this paper one more canonical method to construct the irreducible unitary representations of a connected, simply connected nilpotent Lie group is introduced. Although we used Kirillov' analysis to deduce this procedure, the method obtained differs from that of Kirillov's, in that one does not need to consider the codjoint representation of the group in the dual of its Lie algebra (in fact, neither does one need to consider the Lie algebra of the group, provided one knows certain connected subgroups and their characters). The method also differs from that of Mackey's as one only needs to induce characters to obtain all irreducible representations of the group.

Bassed on the intrinsic structure of a selfmapping T: S → S of an arbitrary set S, called the orbit-structure of T, a new entropy is defined. The idea is to use the number of preimages of an element x under the iterates of T to characterize the complexity of the transformation T and their orbit graphs. The fundamental properties of the orbit entropy related to iteration, iterative roots and iteration semigroups are studied. For continuous (differentiable) functions of Rn to Rn, the chaos of Li and Yorke is characterized by means of this entropy, mainly using the method of Straffingraphs.

New oscillation criteria are established for second order sublinear ordinary differential equations with alternating coefficients. These criteria are obtained by using an integral averaging technique and can be applied in some special cases in which other classical oscillation results are no applicable.

In 1981 two notions of effective presentation of countable connected graphs were formulated by J. C. E. Dekker—namely, edge recognition algorithm graphs and minimal path algorithm graphs. In this paper we show that every planar graph has a minimal path algorithm presentation but that some graphs have no minimal path algorithm presentations. We introduce the notion of a shortest distance algorithm graph, show that it lies strictly between the two notions of Dekker, and show that every graph has a shortest distance algorithm presentation. Finally, in contrast to Dekker's result about minimal path algorithm graphs, we produce a shortest distance algorithm graph which has no spanning tree which is an edge recognition algorithm graph.