Search Results for ""

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

An odd composite number N is called a Somer-Lucas d-pseudoprime (with d>=1) if there exists a nondegenerate Lucas sequence U(P,Q) with U_0=0, U_1=1, D=P^2-4Q, such that ...

A stack F on a topological space X is said to be a stack of groupoids if for each open subset U subset= X, the category F(U) is a groupoid.

Defined for samples x_i, i=1, ..., N by alpha_r=1/Nsum_(i=1)^Nz_i^r=(mu_r)/(sigma^r), (1) where z_i=(x_i-x^_)/(s_x). (2) The first few are alpha_1 = 0 (3) alpha_2 = 1 (4) ...

Sylvester's criterion states that a matrix M is positive definite iff the determinants associated with all upper-left submatrices of M are positive.

In statistics, a trial is a single performance of well-defined experiment (Papoulis 1984, p. 25), such as the flipping of a coin, the generation of a random number, the ...

The zero section of a vector bundle is the submanifold of the bundle that consists of all the zero vectors.

Given a Poisson distribution with rate of change lambda, the distribution of waiting times between successive changes (with k=0) is D(x) = P(X<=x) (1) = 1-P(X>x) (2) = ...

The nth k-statistic k_n is the unique symmetric unbiased estimator of the cumulant kappa_n of a given statistical distribution, i.e., k_n is defined so that <k_n>=kappa_n, ...

The geometric distribution is a discrete distribution for n=0, 1, 2, ... having probability density function P(n) = p(1-p)^n (1) = pq^n, (2) where 0<p<1, q=1-p, and ...