Search Results for ""

An algorithm for computing an Egyptian fraction (Stewart 1992).

A square matrix is called bisymmetric if it is both centrosymmetric and either symmetric or antisymmetric (Muir 1960, p. 19).

A second-order ordinary differential equation of the form

A finite or infinite square matrix with rational entries. (If the matrix is infinite, all but a finite number of entries in each row must be 0.) The sum or product of two ...

When n is an integer >=0, then J_n(z) and J_(n+m)(z) have no common zeros other than at z=0 for m an integer >=1, where J_n(z) is a Bessel function of the first kind. The ...

Brun's sieve was refined by J. B. Rosser, G. Ricci, and others.

A representation of a C^*-algebra A is a pair (H,phi) where H is a Hilbert space and phi:A->B(H) is a *-homomorphism. (H,phi) is said to be faithful if phi is injective. For ...

Let A be a unital Banach algebra. If a in A and ||1-a||<1, then a^(-1) can be represented by the series sum_(n=0)^(infty)(1-a)^n. This criterion for checking invertibility of ...

The Cauchy product of two sequences f(n) and g(n) defined for nonnegative integers n is defined by (f degreesg)(n)=sum_(k=0)^nf(k)g(n-k).

Any row r and column s of a determinant being selected, if the element common to them be multiplied by its cofactor in the determinant, and every product of another element ...