Search Results for ""

A twin prime cluster of order n is a collection of 2n consecutive prime numbers such that consecutive pairs form twin primes. Twin prime clusters were discussed by Mudge ...

The backward difference is a finite difference defined by del _p=del f_p=f_p-f_(p-1). (1) Higher order differences are obtained by repeated operations of the backward ...

The forward difference is a finite difference defined by Deltaa_n=a_(n+1)-a_n. (1) Higher order differences are obtained by repeated operations of the forward difference ...

A sparse matrix is a matrix that allows special techniques to take advantage of the large number of "background" (commonly zero) elements. The number of zeros a matrix needs ...

Let P be a finite partially ordered set. A chain in P is a set of pairwise comparable elements (i.e., a totally ordered subset). The partial order length of P is the maximum ...

An element of order 2 in a group (i.e., an element A of a group such that A^2=I, where I is the identity element).

A polynomial x^n+a_(n-1)x^(n-1)+...+a_1x+a_0 in which the coefficient of the highest order term is 1.

A group G is quasi-unipotent if every element of G of order p is unipotent for all primes p such that G has p-group rank >=3.

The Tits group is a group of order 17971200. It is implemented in the Wolfram Language as TitsGroupT[].

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.