A path of maximum length in a graph G is referred to as a detour path of G and the length of such a path is called the detour number of G. It is not surprising that the study of detour paths is closely associated with the problem of investigating hamiltonian paths in graphs. Evidently few results have been obtained in this area, although Ore [3] has shown that any two detour paths intersect. It is the purpose of this article to further investigate these concepts. In particular, we obtain bounds for several graph theoretic parameters in terms of the detour number and also present formulae for the detour numbers of several important classes of graphs.

The main result of this paper is the determination of all nonisomorphic local near-rings <N, +, •> with <N, +> =<C(p) × C(p), +> which are not near-fields. Together with the fundamental paper [6] by Zassenhaus on near-fields and the corollary to Theorem 1 of [2], this 2 paper gives a complete description of all local near-rings of order p2.

We recall that a unitary near-ring N is called local if the subset L of elements in N without left inverses is an (N, N)-subgroup and N ≠ J(N). (J(N) denotes the radical of N given in [1].) In [3] it was proved that N ≠ J(N) whenever L is an ideal of N. (For previous result s concerning local near-rings we refer the reader to [3].)

The concept of a rational extension of a Lie module is defined as in the associative case [1, pp. 81 and 79]. It then follows from [3, Theorem 2.3] that any Lie module possesses a maximal rational extension (a rational completion), unique up to isomorphism. If now L and K are Lie rings with L⊆ K, we call K a (Lie) ring of quotients of L if K, considered as a Lie module over L, is a rational extension of the Lie module LL. Although we do not know if for every Lie ring L its rational completion can be given a Lie ring structure extending that of L (as is the case for associative rings), this is so, in any case, for abelian Lie rings (Propositions 2 and 4).

In this paper we shall discuss the following set of n + 1 linear inequalities:

If we let , and Z = (zi) (i = 0, 1,…, n) be (n+1)-dimensional column vectors, and define the n+1 by n+1 tridiagonal matrix Dn(ϕ) by

the set of inequalities (1) may be written

where An= Dn(1) and zi≥ 0 (i = 0, 1,…, n). In sections 2 and 3, we

Blackett [4] introduced the concepts of near-ring homomorphism and near-ring ideal. Beidleman [1] established the fundamental homomorphism theorem and the isomorphism theorems for (left) near - rings obeying the condition that 0.a = 0 for every a in the near-ring. Several others, for example [3], [5], and [7], have taken up the study of ideals. This paper takes up the study of homomorphisms of (left) near-rings not subject to the condition 0.a = 0. It is shown that such homomorphisms can be decomposed into homomorphisms of two special sub-near-rings. Conversely, conditions are sought under which homomorphisms of the two sub-near-rings may be mated to produce a homomorphism of the sub-near-ring.

In [1] the Principle of Duality of mathematical logic (which states that the duals of equivalent well-formed formulas are also equivalent) is established by first showing that certain transforms related to the duality transform, also possess this property. The transforms involved are ,, , and which are defined as follows.

Let L denote a finite dimensional, simple Lie algebra over an algebraically closed field F of characteristic zero. It is well known that every weight space of an irreducible representation (ρ, V) admitting a highest weight function is finite dimensional. In a previous paper [2], we have established the existence of a wide class of irreducible representations which admit a one-dimensional weight space but no highest weight function. In this paper we show that the weight spaces of all such representations are finite dimensional.

In [10], it is defined that a right (or left) ideal I of a ring R is very large if the cardinality of R/I is finite. It is also proven in [10, Theorem 3.4] that if R is a prime ring with 1 such that its characteristic is zero, then R is a right order in a simple ring with the minimum condition on one sided ideals if every large right ideal of R is very large. In the present note, we shall prove that if R is a prime ring with 1 such that its characteristic is zero and R is also a compact topological ring, then R is a right and left order in a simple ring with the minimum condition on one sided ideals, which is also a non-discrete locally compact topological ring if and only if every large right ideal of R is open. In particular, if R is an integral domain with 1 (not necessarily commutative) such that its characteristic is zero, then R is openly embeddable [13, p. 58] in a locally compact (topological) division ring if and only if every large right ideal of R is open. Following S. Warner [13], we shall say R is openly embeddable in a quotient ring Q(R) if there is a topology on Q(R) which is compatible with its structure, which induces on R its given topology and for which R is an open subset.

In [3] Gelbaum defined the tensor product A ⊗CB of three commutative Banach algebras, A, B and C and established some of its properties. Various examples are given and the particular case where A, B and C are group algebras of L.C.A. groups G, H and K respectively, is discussed there. It is shown there that if K is compact L1(G) ⊗ L1(K) L1(H) is isomorphic to where is L.C.A. 1 L (K) 1 1 if and only if L1(G) ⊗ L1(K) L1(H) is semisimple.

In 1879 Kempe [5] presented what has become the most famous of all incorrect proofs of the Four Colour Conjecture, but even though his proof was erroneous his method has become quite useful. In 1890 Heawood [4] was able to modify Kempe's method to establish the Five Colour Theorem for planar graphs. In this article we show that other modifications of Kempe's method can be made which enable one to establish more results about planar graphs. By this process we obtain upper bounds for several parameters which involve partitioning the point set of a graph. In particular, we show that the point set of any planar graph can be partitioned into four or less subsets such that the subgraph induced by each subset is either disconnected or trivial (consists of a single point). We also show that the point set of any planar graph can be partitioned into three or less subsets such that the subgraph induced by each subset contains no cycles.

This note proves another special case of a conjecture of U. Oberst. Oberst considered [1], for any small category , the X abelian category of abelian group-valued functors on , and the X functor Colim: which takes each diagram to its colimit. The question is, when is Colim exact? For its relationships, see [1], It is a sufficient condition that each component of is upward filtered. Oberst conjectured that it is also necessary, and proved this under some conditions. He mentioned particularly the case that is a monoid, i.e. a category with one object. We shall verify the conjecture in that case.

Let F[a, b] be the linear space of all real valued functions defined on [a, b]. A linear operator L: C[a, b] → F[a, b] is called positive (and hence monotone) on C[a, b] if L(f)≥0 whenever f≥0. There has been a considerable amount of research concerned with the convergence of sequences of the form {Ln(f)} to f where {Ln} is a sequence of positive linear operators on C[a, b].

The theorem of the title asserts that every non-degenerate continuum (that is, every compact connected Hausdorff space containing more than one point) contains at least two non-cutpoints. This is a fundamental result in set - theoretic topology and several standard proofs, each varying from the others to some extent, have been published. (See, for example, [1], [4] and [5]). The author has presented a less standard proof in [3] where the non-cutpoint existence theorem was obtained as a corollary to a result on partially ordered spaces. In this note a refinement of that argument is offered which seems to the author to be the simplest proof extant. To facilitate its exposition, the notion of a weak partially ordered space is introduced and the cutpoint partial order of connected spaces is reviewed.

In studying differential equations, the usual task is to determine properties of the solutions of such equations from a knowledge of the coefficient functions. The converse question, namely, of determining the coefficient functions from properties of solutions, also has significance. It has been studied especially in the case of Sturm-Liouville equations.

A discussion of the inverse Sturm-Liouville problem can be found in [8, Chapter 8], where references are given to the work of W.A. Ambarzumiam, G. Borg, I.M. Gelfand, M.G. Krein, B.M. Levitan, N. Levinson and W.A. Marchenko on this problem. Work of a quite different character, but dealing also with questions of a converse type arising from Sturm-Liouville equations, has been done by O. Boruvka and his colleagues and students [2].

The purpose of the present note is to give a combinatorial interpretation of the coefficients of expansion of the Ramanujan continued fraction ([1], p. 295)

The result is expressed by formula (12) below.

The enumeration of distinct score vectors of a tournament leads to the following problem: (Erdős and Moser, see Moon [2], p. 68). Given n ≥ 1, k ≥ 0, determine the number of distinct sequences of positive integers

Meir and Sharma [1] have suggested a modification of Romberg quadrature using Newton-Cotes and, in particular, Simpson sums in place of trapezoidal sums. By comparing the error term with that obtained by Bulirsch [3] for trapezoidal sums, they concluded that the use of Simpson sums would lead to an improvement of the results. The procedure adopted by Meir and Sharma [1] permits them to obtain an expression for the error in the numerical quadrature. However, for the purpose of numerical computation, this procedure appears to be less suitable. In section 3, we give an alternative formulation which would enable us to carry out the computation, using Simpson sums, in the same wasy as is done in the case of Romberg quadrature with trapezoidal sums. Some numerical results are discussed in section 4.

If P, Q, R are any three points on a line a and p, q, r are any three lines that pass through a point O and lie in a plane n. which meets the line a in a point A distinct from O, then the three lines l = Qr ⋅ Rq, m = Rp ⋅ P r, n = P q ⋅ Qp lie in a plane (through O).

The General Selection Principle referred to in the title is really Tychonoff's theorem on products of compact spaces, but in a somewhat disguised form (c.f. Theorem 2.1, below). It is believed that this form is one which lends itself very well to many applications. More specifically, one of the immediate corollaries of the main theorem is a theorem due to Rado (c.f. Cor 2.1.1.), which has been used by Erdos and de Bruijn [2], Luxemburg [7], and the author [9] to give simple proofs of a variety of results.

Mikusinski [1] has extended the operational calculus by methods which are essentially algebraic. He considers the family C of continuous complex valued functions on the half-line [0,∞). Under addition and convolution C becomes a commutative ring. Titchmarsh's theorem [2] shows that the ring has no divisors of zero and, hence, that it may be imbedded in its quotient field Q whose elements are then called operators. Included in the field are the integral, differential and translational operators of analysis as well as certain generalized functions, such as the Dirac delta function. An alternate approach [3] yields a rather interesting result which we shall now describe briefly.

For k ≥2, t ≥2, let W(k, t) denote the least integer m such that in every partition of m consecutive integers into k sets, atleast one set contains an arithmetic progression of t+1 terms. This paper presents a construction which improves the best previously known lower bounds on W(k, t) for small k and large t.