Dans cet article nous considerons l'inégalité

où les xi désignent les nombres réels qui remplissent les conditions suivantes

Cette inégalité est proposée par H. S. Shapiro [1].

1. A number of inclusion theorems have been given in connection with methods of summation which include the Riesz method (R, λ, κ). Lorentz [4, Theorem 10] gives necessary and sufficient conditions for a sequence to sequence regular matrix A = (an, v) to be such that A ⊃ (R, λ, 1)†. He imposes restrictions on the sequence { λn}, so that A does not include all Riesz methods of order 1. In Theorem 1 below, we generalize the Lorentz theorem by giving a condition without restriction on λn, If the matrix A is a series to sequence or series to function regular matrix, there do not appear to be any results concerning the general inclusion

A ⊃ (R, λ, κ).

However, when A is the Riemann method (ℜ, λ, μ), Russell [7], generalizing earlier results, has given sufficient conditions for (ℜ, λ, μ) ⊃ (R, λ, κ). Our Theorem 2 gives necessary and sufficient conditions for A ⊃ (R, λ, 1), where A satisfies the condition an, v → 1 (n →co, ν fixed). Thus Theorem 2 applies to any series to sequence regular matrix A. In Theorem 3 we give a further representation for matrices A which include (R, λ, 1), and finally make some remarks on the problem of characterizing matrices which include Riesz methods of any positive order κ.

1. Dual integral equations of the form

where f(x) and g(x) are given and Ψ(x) is the unknown, have been increasingly studied in recent years; the first solutions were given for the case g(x) ≡ 0 by Titchmarsh [1] (for 0 < α < 2) and Busbridge [2] (for — 2 < α < 0). An interesting and much simpler method of solving the equations in the same case, g ≡ 0, was given by Gordon [3]. He also showed that the problem of solving the general equations (1) and (2) can be reduced to a problem in which g ≡ 0. He did not pursue this idea as far as finding and simplifying the solution of (1) and (2) but this has been done recently (see [4]) and Noble [5] used a similar idea in treating the case f ≡ 0.

Let T be a bounded symmetric operator in a Hilbert space H. According to the spectral theorem, T can be expressed as an integral in terms of its spectral family {Eλ}, each Eλ being a certain projection which is known to be the strong limit of some sequence of polynomials in T. It is a natural question to ask for an explicit sequence of polynomials in T that converges strongly to Eλ. So far as the author knows, no complete solution of this problem has been given even when H has finite dimension, i.e. when T is a finite symmetric matrix. Since a knowledge of the spectral family {Eλ} of a finite symmetric matrix carries with it a knowledge of the eigenvalues and eigenvectors, a solution of the problem may have some practical value.

The nth order polylogarithm Lin(z) is defined for |z| ≦ 1 by

([4, p. 169], cf. [2, §1. 11 (14) and § 1. 11. 1]). The definition can be extended to all values of zin the z-plane cut along the real axis from 1 to ∝ by the formula

[2, §1. 11(3)]. Then Lin(z) is regular in the cut plane, and there is a differential recurrence relation [4, p. 169]

It is convenient to extend the sequence Lin(z) backwards in the manner suggested by (2) and define

Then Li1(z)= – log(l–z), and Lin(z) is a rational function of z for n= 0, – 1, – 2,…. Formula (2) now holds for all integers n.

1. For any positive integral n and any positive real x1,…,xn we write

clearly. It is known [1,2] that

for n ≦ 6, and further [4, 5, 6] that (5) is false for even n ≧ 14 and for odd n ≧ 53. Mordell [2] conjectured that (5) is false for all n ≧ 7, but recently [3] stated that computations indicated that (5) is true for n = 7 and gave some calculations in support of (5) for n = 7.

There exist several different approaches to the problem of solving dual integral equations involving Bessel Functions [1, 2, 3, 4, 5, 6,7], and Erdelyi and Sneddon in a recent paper [8] have shown that the introduction of certain operators occurring in the theory of fractional integration enables the relationships between the various methods to be clearly demonstrated. For dual integral equations other than those involving Bessel Functions the operators introduced by Erdélyi and Sneddon are not always the appropriate ones to use and it seems to be of interest to consider this more general type of situation.

It is proposed to establish the two following integrals.

where n is a positive integer, x is real and positive, μi and ν are complex, and Δ (n; a) represents the set of parameters

where n is a positive integer and x is real and positive.

We define two functions F(p), G(p) in terms of a third function ψ(ζ) by the equations

A standard problem in the theory of dual integral equations is to determine the function ψ(ζ) such that

when the functions f(p), g(p) are prescribed.

In 1958 Ragab [3] deduced the sums of certain infinite series involving a product of two E-functions in terms of E-functions. MacRobert [2] gave a very simple alternative method for proving the results of Ragab. Later, Ragab [4, 5] in 1962 used a method similar to the one given by MacRobert to deduce a number of summations involving products of E-functions. In this paper, some more general summations of E-functions, which contain Ragab's results as special cases, are given. It may be mentioned that all the series summed run from n = – ∞ to + ∞co instead of n = 0 to + ∞.

1. Introductory. In this paper certain infinite integrals involving products of four Bessel functions of different arguments are evaluated in terms of Appell's function F4 by the methods of the operational calculus. The results obtained are believed to be new.

As usual, the conventional notation will be used to denote the classical Laplace integral relation

In the proofs of the formulae the following results will be required [1, pp. 281, 284], [3, pp. 78, 79].

If the set K of r+1 distinct integers k0, k1 …, kr has the property that the (r+1)r differences ki–kj (0≦i, j≦r, i≠j) are distinct modulo r2+r+1, K is called a perfect difference set modr2+r+1. The existence of perfect difference sets seems intuitively improbable, at any rate for large r, but in 1938 J. Singer [1] proved that, whenever r is a prime power, say r = pn, a perfect difference set mod p2n+pn+1 exists. Since the appearance of Singer's paper several authors have succeeded in showing that for many kinds of number r perfect difference sets mod r2+r+1 do not exist; but it remains an open question whether perfect difference sets exist only when r is a prime power (for a comprehensive survey see [2]).

A fundamental problem in the theory of ordinals is the assignation of principal sequences to limit numbers of the second number class.

It is our main object here to show that a certain class of methods, which are a natural generalisation of those used in the solution of the corresponding problem for the real numbers (the description of which we omit), must fail to solve the problem. The methods are those which rest on the following assumption: the principal sequence assigned to any limit number of the second number class is determined once the first i terms of that sequence are known.

Let A be an associative ring. Given a ∊ A, an element b ∊ A is called a left identity for a if

Given a subset S of A, an element b ∊ A is, called a left identity for S if (1) is satisfied for all a ∊ S. An element of A need not have a left identity; for example, if A is nilpotent then no non-zero element of A has a left identity. If a does have a left identity, the latter need not be unique; if every element of a subset S of A has a left identity, then it is not necessarily true that S has a left identity.

Let {Si; i ε I} be a finite or infinite family of cancellative semigroups. Let U be a cancellative semigroup, and suppose that there exists, for each i in I, a monomorphism φi: u→ Si. We are interested in finding a semigroup T with the following properties.

(a) For each i in I, there is a monomorphism λi: Si → T such that uφiλi = uøjλi for all u ɛ U and all i, j in I. That is to say, there exists a monomorphism λ: U → T which equals øiλi for all i in I.

Siλi∩Sjλj = Uλ (i, j ε I; i ≠ j).

We begin this paper by considering a Boolean algebra as a lattice which is relatively pseudo-complemented (i.e., residuated with respect to intersection) and give, in this case, certain properties of the equivalences of types A, B and F(as introduced by Molinaro [1]). We then show how these results carry over to the case of Boolean matrices, which form a Boolean algebra residuated also with respect to matrix multiplication. Other properties of matrix residuals are established and we conclude with three algebraic characterisations of invertible Boolean matrices.

In a previous paper in this journal [1], I gave formulae for determining the coefficients in certain dual trigonometrical series. The derivation of these formulae involved rather sophisticated assumptions and some intricate manipulation of the hypergeometric function and relied heavily on the solution of Schlömilch's integral equation. I have now found a much simpler formal solution by using Mehler's integral representation of the Legendre polynomial and the final formulae for the coefficients can be given in a more attractive form. As the results of my previous work have had several recent applications to physical problems, it seems worth while to give some details of this improved solution.

For i, j = 1, 2, …, let aij be real. A matrix A = (aij) will be called positive (A>0) or non-negative (A≧0) according as, for all i and j, aij>0 or aij≧0 respectively. Correspondingly, a real vector x = (x1, x2, …) will be called positive (x>0) or non-negative (x≧0) according as, for all i, xi>0 or x≧0. A matrix A is said to be bounded if ∥ Ax ∥ ≦M ∥ x ∥ holds for some constant M, 0 ≦ M < ∞, and all x in the Hilbert space H of real vectors x = (x1, x2, …) satisfying . The least such constant M is denoted by ∥ A ∥. If x and y belong to H, then (x, y) will denote as usual the scalar product Σxiyi. Whether or not x is in H, or A is bounded, y = Ax will be considered as defined by

whenever each of the series of (1) is convergent.

By the group G(2 cos π/q) we mean the group of linear fractional transformations of the complex plane onto itself, generated by V(z)= — 1/z and U(z) = z+λq, where λq = 2 cos (π/q), qbeing a positive integer greater than 2. In this paper we shall be concerned only with the group given by q = 5, and we shall therefore omit the subscript 5 on the λ. We note that λ = λ5 satisfies the equation

x2–x–l=0;(1)

henceλ = (l + 5½)/2.