Search Results for ""

A two-coloring of a complete graph K_n of n nodes which contains exactly the number of monochromatic forced triangles and no more (i.e., a minimum of R+B where R and B are ...

The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...

An (m+1)-dimensional subspace W of an (n+1)-dimensional vector space V can be specified by an (m+1)×(n+1) matrix whose rows are the coordinates of a basis of W. The set of ...

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...

A group homomorphism is a map f:G->H between two groups such that the group operation is preserved:f(g_1g_2)=f(g_1)f(g_2) for all g_1,g_2 in G, where the product on the ...

An H-space, named after Heinz Hopf, and sometimes also called a Hopf space, is a topological space together with a continuous binary operation mu:X×X->X, such that there ...

tau is the ratio tau=omega_2/omega_1 of the two half-periods omega_1 and omega_2 of an elliptic function (Whittaker and Watson 1990, pp. 463 and 473) defined such that the ...

A hypergeometric series sum_(k)c_k is a series for which c_0=1 and the ratio of consecutive terms is a rational function of the summation index k, i.e., one for which ...

The hypotenuse of a right triangle is the triangle's longest side, i.e., the side opposite the right angle. The word derives from the Greek hypo- ("under") and teinein ("to ...

A hypothesis is a proposition that is consistent with known data, but has been neither verified nor shown to be false. In statistics, a hypothesis (sometimes called a ...