Search Results for ""
131 - 140 of 763 for Chi Squared DistributionSearch Results
![](/common/images/search/spacer.gif)
Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...
Given a nonzero finitely generated module M over a commutative Noetherian local ring R with maximal ideal M and a proper ideal I of R, the Hilbert-Samuel function of M with ...
The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...
Fisher's exact test is a statistical test used to determine if there are nonrandom associations between two categorical variables. Let there exist two such variables X and Y, ...
Given a geodesic triangle (a triangle formed by the arcs of three geodesics on a smooth surface), int_(ABC)Kda=A+B+C-pi. Given the Euler characteristic chi, intintKda=2pichi, ...
The Lerch transcendent is generalization of the Hurwitz zeta function and polylogarithm function. Many sums of reciprocal powers can be expressed in terms of it. It is ...
For a set of n numbers or values of a discrete distribution x_i, ..., x_n, the root-mean-square (abbreviated "RMS" and sometimes called the quadratic mean), is the square ...
"Analysis of Variance." A statistical test for heterogeneity of means by analysis of group variances. ANOVA is implemented as ANOVA[data] in the Wolfram Language package ...
A number taken to the power 3 is said to be cubed, so x^3 is called "x cubed." This terminology derives from the fact that the volume of a cube of edge length x is given by ...
The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...
![](/common/images/search/spacer.gif)
...