Search Results for ""

Every finite Abelian group can be written as a group direct product of cyclic groups of prime power group orders. In fact, the number of nonisomorphic Abelian finite groups ...

A polynomial discriminant is the product of the squares of the differences of the polynomial roots r_i. The discriminant of a polynomial is defined only up to constant ...

The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...

Let {y^k} be a set of orthonormal vectors with k=1, 2, ..., K, such that the inner product (y^k,y^k)=1. Then set x=sum_(k=1)^Ku_ky^k (1) so that for any square matrix A for ...

In elementary geometry, orthogonal is the same as perpendicular. Two lines or curves are orthogonal if they are perpendicular at their point of intersection. Two vectors v ...

A four-vector a_mu is said to be spacelike if its four-vector norm satisfies a_mua^mu>0. One should note that the four-vector norm is nothing more than a special case of the ...

A four-vector a_mu is said to be timelike if its four-vector norm satisfies a_mua^mu<0. One should note that the four-vector norm is nothing more than a special case of the ...

Let p_n be the nth prime, then the primorial (which is the analog of the usual factorial for prime numbers) is defined by p_n#=product_(k=1)^np_k. (1) The values of p_n# for ...

A polynomial given by Phi_n(x)=product_(k=1)^n^'(x-zeta_k), (1) where zeta_k are the roots of unity in C given by zeta_k=e^(2piik/n) (2) and k runs over integers relatively ...

Let gamma(G) denote the domination number of a simple graph G. Then Vizing (1963) conjectured that gamma(G)gamma(H)<=gamma(G×H), where G×H is the graph product. While the ...