For positive integral n let Cn denote the n-dimensional unit cube with vertices (δ1, δ2,…, δn) where δi = 0 or 1 for i=1, 2,…, n. Call two vertices of Cn adjacent if the distance between them is 1.

An ordered plane [1, p. 177 ff.] is a set of undefined entities called points, together with an undefined relation of intermediacy, satisfying the following axioms: (The symbol [ABC] means ″B is between A and C″.)

This note proves (in the theorem below) a conjecture made by the author last year through the pages of the Departmental Problem Book. This arose in connection with some other investigations of arithmetic functions.

How many spheres of given diameter can be packed in a cube of given size? Or: What is the maximum diameter of k identical spheres if they can be packed in a cube of given size? These questions are obviously equivalent to the following problem:

Let d(Pi, Pj) denote the distance between the points Pi and Pj, and Γk the set of all configurations of k points Pi (1 ≤ i < j ≤ k) in a closed unit cube C.

Sylvester [7] proposed the following question in 1893. If a finite set of points in a plane is such that on the line determined by any two points of the set there is always a third point of the set, is the set collinear? Equivalently, given a finite planar set of non-collinear points, does there exist a line containing exactly two of the points?

A surface S of constant width is the boundary of a convex set K of constant width in euclidean 3-dimensional space E3. (See [l] pp. 127–139. )

Our first result concerns the interdependence of five properties which a curve on such a surface may possess. Let S be a surface of constant width D > 0 which satisfies the smoothness condition that it be a 2-dimensional submanifold of E3 of class C2.

Let σ*(N) denote the sum of the unitary divisors of N, that is,

It is easily seen that σ*(N) is multiplicative. In fact σ*(l) = 1 if N > 1 has the prime decomposition . Let us define a positive integer to be unitary perfect whenever σ*(N) = 2N. The first four such numbers are 6, 60, 90 and 87, 360. In a recent abstract [ l ] published by one of us, the last of these numbers was overlooked. No other unitary perfect numbers are known to the authors.

By the celebrated theorem of Jordan [3] and Hölder [2], there is associated with each finite group G a family of distinct simple groups Hi. such that every composition series of G has ni factor groups isomorphic to Hi and no others. We denote the collection of pairs (Hi, ni) by CF(G). Conversely, given k pairs (Hi, ni), we may construct by an easy direct product procedure a group G with CF(G) = { (Hi, ni) | i =1,…, k}. The composition factors, of course, do not in general determine the group.

A (round-robin) tournament Tn consists of n nodes p1, p2, …, Pn such that each pair of distinct nodes pi and pj is joined by one of the oriented arcs or . If the arc is in Tn, then we say that pi. dominates pj. The set of all dominance-preserving permutations a of the nodes T form a group, the automorphism group G(T ) of Tn. It is known (see [1]) that there exist tournaments Tn whose group n G(Tn) is abstractly isomorphic to a given group H if and only if the order g(H) of H is odd.

The purpose of this paper is to locate five points Pi ( l ≤ i ≤ 5 ) in a closed unit cube C such that is as large as possible, where d(Pi, Pj) denotes the distance i j between Pi and Pj. We prove that this minimum distance cannot exceed (=m, say), and if it is equal to m, then the corresponding configuration is congruent to the set of points shown in fig. 1, namely P1 = A1 (0,0,0), P2 = A8 (1, 1, 1), P3 = B1 (0,1/2,1), P4 = B3 (1/2,1,0) and P5 = B5 (1, 0, 1/2).

We call a semigroup S transitive if S is isomorphic to a semigroup T of transformations of some set M into itself, where T acts on M transitively, that is in such a manner that for all x, y ∊ M we have Xπ = y for some transformation π∊T. In [4] the author showed that S is transitive if and only if there exists a right congruence σ (i.e., an equivalence relation for which a σ b always implies ac σ bc for all c ∊ S) on S, satisfying:

1. (1)There exists a left identity modulo σ, that is an element e such that ea σ a for all a ∊ S .

2. (2)Each σ-class meets each right ideal, or, equivalently, for all a, b ∊ S we have ac σ b for some c ∊ S .

3. (3)The relation σ contains ( i. e. , is less fine than) no left congruence except the identity relation (in which each class consists of a single element).

P. Erdös and R. Rado [1] proved that to each pair of positive integers n and k, with k ≥ 3, there corresponds a least positive integer φ(n, k) such that if is a family of more than φ(n, k) sets, each set with n elements, then some k of the sets have pair-wise the same intersection.

There is considerable literature concerning the century old result that for arbitrary positive integers a and m,

1.1

where μ(m) is the usual Mobius function. For earlier work on this we refer to L.E. Dickson [4, pp. 84–86] and L. Carlitz [1,2]. Another reference not noted by the above authors is R. Vaidyanathaswamy [6], who noted that the left member of (1.1) represents the number of special fixed points of the m th power of a rational transformation of the n th degree.

The aim of this paper is to collect some interesting unsolved problems in the topology of compact complex manifolds which are scattered in literature; needless to remark, some of them are known to specialists. Besides, the readermay consult the well-known list of problems by F. Hirzebruch [ 5 ] which has stimulated remarkable progress in this direction. But the topology of complex manifolds has always baffled workers in this field and is still far from satisfactory. Of course, there is remarkable progress in the case of homogeneous compact complex manifolds. We start with the following result.

This packing problem is obviously equivalent to the problem of locating six points Pi(l ≤ i ≤ 6) in a- closed unit cube C such that is as large as possible, where d(Pi, Pj) denotes the distance between Pi and Pj. We shall prove that this minimum distance cannot exceed (= m, say), and that 4 it attains this value only if the points form a configuration which is congruent to the one of the points Ri(l≤i≤6) shown in fig. 1. Note that , and so the six points are the vertices of a regular octahedron.

We study free and injective Lie modules by investigating the relationship between Lie modules and (associative) modules. An important role is played by the universal enveloping ring of a Lie ring [4]. If L is an arbitrary Lie ring and W(L) its universal enveloping ring, we show that the category of Lie L-modules and the category of associative W(L)-module s are isomorphic (section 2). In section 3 we study free Lie modules and show how they may be obtained from free associative modules. A Lie module is free if and only if it is a direct sum of copies of the free Lie module on one generator.

A Thomsen graph [2, p. 22] consists of six vertices partitioned into two classes of three each, with every vertex in one class connected to every vertex in the other; it is the graph of the “gas, water, and electricity” problem [1, p. 206]. (All graphs considered in this paper will be undirected, having neither loops nor multiple edges.)

If {avα: or = 1, 2, …, N }, with Nv → ∞ as v → ∞, is a double sequence of real numbers with the property that , then

1.1

is known in statistical literature as the Wald- Wolfowitz- Noether condition and it plays an important role in the proofs of certain types of central limit theorems (see e. g., [ l ], [2] ).

Let p denote a prime and n a positive integer. Write q = pn and let kq denote the Galois field with q elements. The unique factorization domain of polynomials in m(≤ 2) indeterminâtes x1,…, xq with coefficients in k is denoted by kq [x,…, xm. It is the purpose of this note to prove the foliowing generalization of Eisenstein's irreducibility criteria and to point out some of its consequences.

Let A: a1 < a2 < … < ak be a set of non-negative integers We call the corresponding polynomial the characteristic polynomial, or briefly, the c-polynomial of A. Any polynomial of such a form we call a c-polynomial and any factorization of a c-polynomial into others of the kind we call a c-factorization. If a c-polynomial cannot be factored in this way we call it c-irreducible. In this note we will determine all c-factorizations of the polynomial 1 + x + x2 + … + xn-1, and will find under what circumstances the c-irreducible factors are also irreducible in the usual sense, i.e., irreducible over the field of rationals.