Search Results for ""

The set of all zero-systems of a group G is denoted B(G) and is called the block monoid of G since it forms a commutative monoid under the operation of zero-system addition ...

Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...

Given a symmetric positive definite matrix A, the Cholesky decomposition is an upper triangular matrix U with strictly positive diagonal entries such that A=U^(T)U. Cholesky ...

The automorphism group Co_1 of the Leech lattice modulo a center of order two is called "the" Conway group. There are 15 exceptional conjugacy classes of the Conway group. ...

The Cramér conjecture is the unproven conjecture that lim sup_(n->infty)(p_(n+1)-p_n)/((lnp_n)^2)=1, where p_n is the nth prime.

The cross number of a zero-system sigma={g_1,g_2,...,g_n} of G is defined as K(sigma)=sum_(i=1)^n1/(|g_i|) The cross number of a group G has two different definitions. 1. ...

A number is said to be cubefree if its prime factorization contains no tripled factors. All primes are therefore trivially cubefree. The cubefree numbers are 1, 2, 3, 4, 5, ...

The equation x^p=1, where solutions zeta_k=e^(2piik/p) are the roots of unity sometimes called de Moivre numbers. Gauss showed that the cyclotomic equation can be reduced to ...

A cyclotomic field Q(zeta) is obtained by adjoining a primitive root of unity zeta, say zeta^n=1, to the rational numbers Q. Since zeta is primitive, zeta^k is also an nth ...

The Davenport constant of a finite Abelian group G is defined to be the length of the longest minimal zero-system of G and is denoted D(G). Symbolically, ...