Search Results for ""

A graph G is said to be flexible if the vertices of G can be moved continuously so that (1) the distances between adjacent vertices are unchanged, and (2) at least two ...

The Gaussian joint variable theorem, also called the multivariate theorem, states that given an even number of variates from a normal distribution with means all 0, (1) etc. ...

For a form Q, the generic character chi_i(Q) of Q is defined as the values of chi_i(m) where (m,2d)=1 and Q represents m: chi_1(Q), chi_2(Q), ..., chi_r(Q) (Cohn 1980, p. ...

2^(30)=1024^3=1073741824 bytes. Although the term gigabyte is sometimes used to refer to 1024^3 bytes, such usage is deprecated in favor of the standard SI naming convention ...

An algebraic ring which appears in treatments of duality in algebraic geometry. Let A be a local Artinian ring with m subset A its maximal ideal. Then A is a Gorenstein ring ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

A necessary and sufficient condition that there should exist at least one nondecreasing function alpha(t) such that mu_n=int_(-infty)^inftyt^ndalpha(t) for n=0, 1, 2, ..., ...

The Harada-Norton group is the sporadic group HN of order |HN| = 273030912000000 (1) = 2^(14)·3^6·5^6·7·11·19. (2) It is implemented in the Wolfram Language as ...

The hazard function (also known as the failure rate, hazard rate, or force of mortality) h(x) is the ratio of the probability density function P(x) to the survival function ...

The Held group is the sporadic group He of order |He| = 4030387200 (1) = 2^(10)·3^3·5^2·7^3·17. (2) It is implemented in the Wolfram Language as HeldGroupHe[].