For G a, finite group let α(G) denote the minimum number of vertices of the graphs X the automorphism group A(X) of which is isomorphic to G.

G. Sabidussi proved [1], that α(G)=0(n log d) where n=\G\ and d is the minimum number of generators of G.As 0(log n) is the best possible upper bound for d, the result established in [1] implies that α(G)=0(n log log n).

M. Slater has shown that a prime alternative (not associative) ring R such that 3R≠0 is a Cayley-Dickson ring, [7], That is, if F is the field of quotients of the center, Z, of R then F ⊗Z R is a Cayley-Dickson algebra.

Suppose that

1.1

is a transcendental integral function. In this article we develop the theory initiated by Wiman [22, 23] and deepened by other writers including Valiron [18, 19, 20], Saxer [15], Clunie [4, 5] and Kövari [10, 11], which describes the local behaviour of f(z), near a point where | f(z) | is large, in terms of the power seriesf of f(z).

Huppert, Janko and Mann have proved the following theorems for a finite group G.

(Huppert [4]). If each second maximal subgroup of G is normal in G, then G is supersolvable. If the order of G is divisible by at least three different primes, then G is nilpotent.

(Huppert [4]). Let each third maximal subgroup of G be normal in G. Then: (i) G′ is nilpotent; (ii) the rank of G=r(G)≤2; (iii) if |G| is divisible by at least three different primes, then G is supersolvable.

Let R be a commutative ring with non-zero identity and let K be the total quotient ring of R. We call R a G-ring if K is finitely generated as a ring over R. This generalizes Kaplansky′s definition of G-domain [5].

Let Z(R) be the set of zero divisors in R. Following [7] elements of R—Z(R) and ideals of R containing at least one such element are called regular. Artin-Tate's characterization of Noetherian G-domains [1, Theorem 4] carries over with a slight adjustment to characterize a Noetherian G-ring as being semi-local in which every regular prime ideal has rank one.

The Levitzki radical, which is fundamental in the study of algebras satisfying a polynomial identity, has been shown to exist in the varieties of alternative and Jordan algebras (see Zhevlakov [8], Zwier [9], and Tsai [7]— for an important application of this radical to alternative algebras satisfying a polynomial identity, see Slater [6]). In fact, Hartley [4] even investigated local nilpotence for Lie algebras, though this property can not be radical in the sense of Kurosh-Amitsur [3] for these algebras.

Suppose throughout that s, an (n=0,1, 2,…) are arbitrary complex numbers, that α>0 and β is real and that N is a non-negative integer such that αN+β≧l. Let

where z=x+iy is a complex variable and the power zr is assumed to have its principal value.

Let d=(d1,…,dn) be a sequence of positive integers. In this note we show that d is realizable by a graph whose square is hamiltonian if and only if (i) d is realizable by some graph, (ii) n≥3, and (iii) d1+…+dn≥2(n-1). In fact, we prove that if d is realizable by a connected graph, then d is realizable by a graph with a spanning caterpillar. From this it follows that if d is realizable by a connected graph, it is realizable by a graph whose square is pancyclic. We also prove that d is realizable by a graph with a spanning wreath if and only if d is realizable by some graph and d1+…+dn≥2n. (A wreath is a connected graph that has exactly one cycle and all vertices not in the cycle monovalent.)

W. Burnside [3, p. 343] showed that a cyclic group of order pm (p prime, m > l) cannot occur as a regular subgroup of a simply transitive primitive group. (For definitions and notation see [9].) Groups which are contained regularly in a primitive group G only when G is doubly transitive are therefore called B-groups [9, p. 64].

Given a first-order theory T, welet be the category of models of T and homomorphisms between them. We shall show that a morphism A→B of is an epimorphism if and only if every element of B is definable from elements of A in a certain precise manner (see Theorem 1), and from this derive the best possible Cowell- power Theorem for .

Fuchs, in [3], problem 14, proposes the study of pure-high subgroups of an abelian group. In this paper we show that in abelian torsion groups, pure-high subgroups are also high. A natural problem arises, that of characterizing the pure-absolute summands. We show that this concept is the same as absolute summands in torsion groups, but that it is more general in mixed abelian groups. There is a definite connection between the existence of pure TV-high subgroups and the splitting of mixed groups. The notation is that of [3].

This paper deals with the notion of equational compactness and related concepts in the special case of G-sets for an arbitrary group G. It provides characterizations of pure extensions, pure-essential extensions, and equational compactness in terms of the stability groups of a G-set, proves the general existence of equationally compact hulls, and gives an explicit description of these. Further, it establishes, among other results, that all G-sets are equationally compact iff all subgroups of the group G are finitely generated, that every equationally compact G-set is a retract of a topologically compact one, and that for free groups G with infinite basis there are homogeneous G-sets which are not equationally compact.

One of the features that make right-ordered groups harder to investigate than ordered groups is that their system of convex subgroups may fail to have the following property:

(*) if C and C’ are convex subgroups of G and C’ covers C, then C is normal in C’ and C’/C is order-isomorphic to a subgroup of the naturally ordered additive group of real numbers.

To give a geometric interpretation to the inverted incidence relation between the flats of a geometry has for years been a tempting idea in combinatorial geometries [1]. If G is a geometric lattice, the inverted lattice G' is not necessarily geometric.

The relationships between synchronous and asynchronous reversible Markov systems are investigated. It is shown that the invariant measure of such systems is a second order Markov random field. The conditions under which the invariant measure is a first order Markov random field are obtained.

In [15], O. Taussky-Todd posed the problem of title, namely to find X, Y, Z when A, B are given. Clearly if X, Y, Z exist then A, B are either both invertible or both noninvertible.

In section 1, the problem is reviewed in case A, B are both invertible. The problem is seen to be fundamentally one of group theory rather than matrix theory. Application of results of Shoda, Thompson, Ree to the general group-theoretical results allows specialization to certain matrix groups.

In Section 2, examples and counterexamples are given in case A, B are noninvertible. A general necessary condition for solvability (involving ranks) is obtained. This condition may or may not be sufficient. For dim A=2, 3 the problem is settled: there is always a solution in the noninvertible case.

We consider finite dimensional complex vector bundles over a compact connected Hausdorff space X, as defined, for example, in [1]. It is well known that if ξ is such a bundle, then there is a bundle η such that ξ⊕η is trivial.

A category space is a measure space which is also a topological space, the measure and the topology being related by ‘a set is measurable iff it has the Baire property’ and ‘a set is null iff it is nowhere dense’ [4]. We considered some category spaces in [3]; now we show that if a null set is deleted from the space, then the topology can be taken to be completely regular. The essential part of the construction consists of obtaining a suitable refinement of the original sequential covering class and using the consequent strong upper density function to define the required topology. Then the complete regularity follows much as in [1].

The goal of this paper is to relate plane cubic graphs which are not bipartite to plane bipartite cubic graphs which have properties (face-coloring with three colors, existence of two-factors whose cycles are boundaries of faces) characterizing this class of graphs.

The complementarity problem is defined and studied for cases where the constraints involve convex cones, thus extending the real and complex complementarity problems. Special cases of the problem are equivalent to dual, linear or quadratic, programs over polyhedral cones.