Search Results for ""

The Delsarte graph is a strongly regular graph on 243 vertices with regular parameters (nu,k,lambda,mu)=(243,110,37,60). It is distance-regular as well as distance-transitive ...

Eisenstein's irreducibility criterion is a sufficient condition assuring that an integer polynomial p(x) is irreducible in the polynomial ring Q[x]. The polynomial ...

The Euler triangle formula states that the distance d between the incenter and circumcenter of a triangle is given by d^2=R(R-2r), where R is the circumradius and r is the ...

A group action phi:G×X->X is called faithful if there are no group elements g (except the identity element) such that gx=x for all x in X. Equivalently, the map phi induces ...

Fermat's sandwich theorem states that 26 is the only number sandwiched between a perfect square number (5^2=25) and a perfect cubic number (3^3=27). According to Singh ...

A filtration of ideals of a commutative unit ring R is a sequence of ideals ... subset= I_2 subset= I_1 subset= I_0=R, such that I_iI_j subset= I_(i+j) for all indices i,j. ...

The first Morley cubic is the triangle cubic with trilinear equation sum_(cyclic)alpha(beta^2-gamma^2)[cos(1/3A)+2cos(1/3B)cos(1/3C)]. It passes through Kimberling centers ...

A formal power series, sometimes simply called a "formal series" (Wilf 1994), of a field F is an infinite sequence {a_0,a_1,a_2,...} over F. Equivalently, it is a function ...

A one-dimensional map whose increments are distributed according to a normal distribution. Let y(t-Deltat) and y(t+Deltat) be values, then their correlation is given by the ...

Given a linear code C, a generator matrix G of C is a matrix whose rows generate all the elements of C, i.e., if G=(g_1 g_2 ... g_k)^(T), then every codeword w of C can be ...