E. Cohen [1], [2] has considered an analogue of the famous Goldbach problem in certain finite rings. In the following another analogue is considered in the ring Jn of residue classes over the integers modulo n.

As 'primes' in Jn we take all residue classes coprime to n. That is, all elements p ϵ Jn which are not factors of zero in Jn. We denote this set by Rn.

It is well known that a symmetric and transitive relation on a set is reflexive wherever it is defined. In this note we show that a converse is true for homomorphic relations in certain classes of algebras.

Consider a class of similar algebras which contains the sub-algebras and quotient algebras of each of its members. Assume also that the direct product A x B of each pair A, B in is also an algebra belonging to . The algebras of , being similar, have the same set of operations. We observe that other operations, called compound operations, may be obtained by composition from the assigned operations.

The generalized symmetric group S(n, m) consists of all permutations of mn symbols commutative with

Since each cycle Qi = (1i 2i … mi) is of order m, there are mn permutations within the n cycles, generating an invariant subgroup Q of order mn. Also, there are n! ways of permuting the cycles among themselves, by transformations

where i1, i2, …, in are the symbols 1, 2, …, n in some order [5, p. 39]. The permutations W* form a subgroup Sn* of order n!, isomorphic to the symmetric group Sn.

In a recent series of papers [3,4,5], H. Zassenhaus considered the structure of those linear transformations T on real 4-space, R4, into itself that preserve the quadratic form . That is,

1.1

Define a function ϕ on R4 to the space M 2 of 2-square matrices over the complex numbers as follows:

1.2

Let G2 be the vector space of matrices generated by all real linear combinations of

1.3

A “cubic” graph is one with three edges incident on each vertex. Let v and e be the number of vertices and edges, respectively. Then 3v = 2e for a cubic graph. The girth of a graph is the smallest number of edges in any non-trivial polygon. A minimal graph is one with the smallest number of edges with its particular properties. The minimal cubic graphs of girths one to eight, excluding seven, are discussed in Tutte's paper [1]. A minimal cubic graph of girth seven is given here.

The tenth problem on Hilbert's well known list [1] is the following.

(H 10) For an arbitrary polynomial P = P(x1,x2,…,xn) with integer coefficients to determine whether or not the equation P = 0 has a solution in integers.

By 'integers' we always mean 'rational integers'. The problem (H 10) is still unsolved but it appears likely that no decision procedure exists; in this connection see [2]. It will be shown here that (H 10) is equivalent to deciding whether or not every member of a certain given countable sec of rational functions of a single variable x is absolutely monotonie. We recall that f(x) is absolutely monotonie in I if f(x) possesses non-negative derivatives of all orders at every x ∊ I.

In an earlier paper [1] we presented a representation theory for the Fourier transformation defined by

1.1

for functions f in certain function spaces. This theory made use of an operator

1.2

where k = 1, 2,…, and it was stated without proof that this operator is an inversion operator for the Fourier transformation; that is, that under certain conditions

1.3

Following E. H. Feller [l], a ring R is called a duo ring if every one-sided ideal of R is a two-sided ideal.

In the first part of this paper, we give some properties of duo rings and we show that the set of the nilpotent elements of a duo ring R is an ideal, the intersection of the completely prime ideals of R.

It is easy to see that every duo ring is a subdirect sum of subdirectly irreducible duo rings. We give in the second part of this paper a characterization of the subdirectly irreducible duo rings. This characterization is quite similar to the characterization of the subdirectly irreducible commutative rings, due to N. H. McCoy [2], whose methods we use.

In a finite dimensional vector space V a set xi, i = 1, 2, …, n of vectors of V is said to be a basis, base, or coordinate system for V if the vectors xi are linearly independent and if each vector in V is a linear combination of the elements x1 with real coefficients. If a topology for V is defined in terms of a norm ||.|| then {xi} is a basis for V if and only if to each x ϵ V corresponds a unique set of constants ai such that

In infinite dimensional normed vector spaces the above concepts of basis have different generalizations. The first or algebraic definition gives a Hamel basis which is a maximal linearly independent set [l, p. 2]. We shall be interested in the other or topological definition.

This note gives a proof for the familiar elementary theorem that if a permutation of the integers 1, …, n (with n ≥ 2) is expressed as a product π1 of N1 transpositions and also as a product π2 of N2 transpositions, then N1 and N2 are both even or both odd (equivalently: N1 + N2 is even).

Here, a transposition means an interchange of two of the integers. If the interchange is between adjacent integers it is called an adjacent-trans position.

The point of this note is to get a lemma which is useful in treating homotopy between paths in a topological space [1].

As explained in the reference, two paths joining a given pair of points in a space E are homotopic if there exists a mapping F: I x I →E (I being the closed interval [0,1] ) which deforms one path continuously into the other. In practice, when two paths are homotopic and the mapping F is constructed, then the verification of all its required properties, with the possible exception of continuity, is trivial. The snag occurs when F is a combination of two or three functions on different subsets of I x I. Then the boundary lines between these subsets have to be given special consideration, and although the problems resulting are routine their disposal can involve some tedious calculation and repetition. In the development [l] of the fundamental group of a space, for example, this sort of situation comes up four or five times.

Let f(x) be a bounded odd function, - π < x < π, |f(X)| ≤ 1, with non-negative Fourier coefficients bk, k = 1,2, ….

Otto Szász [l] proved anew the existence of a bounded set of numbers {βn}, n = 1,2,…, such that

where βn is the smallest constant satisfying the above inequality and added that 2/π ≤ βn ≤ 4/π. He pointed out [1, p. 170] that β1 = 4/π and raised the question of the value of βn for n > 1.