Search Results for ""

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

A three-dimensional data set consisting of stacked two-dimensional data slices as a function of a third coordinate.

One of the Eilenberg-Steenrod axioms which states that, if X is a space with subspaces A and U such that the set closure of A is contained in the interior of U, then the ...

The fifth of Peano's axioms, which states: If a set S of numbers contains zero and also the successor of every number in S, then every number is in S.

A labeled graph G=(V,E) is a finite series of graph vertices V with a set of graph edges E of 2-subsets of V. Given a graph vertex set V_n={1,2,...,n}, the number of ...

n sets of s trials each, with the probability of success p constant in each set. var(x/n)=spq+s(s-1)sigma_p^2, where sigma_p^2 is the variance of p_i.

Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the local discrepancy is defined as D(J,P)=|(number of x_n in J)/N-Vol(J)|, Vol(J) is the ...

A set M of all polynomials in s variables, x_1, ..., x_s such that if P, P_1, and P_2 are members, then so are P_1+P_2 and QP, where Q is any polynomial in x_1, ..., x_s.

A basis of a modular system M is any set of polynomials B_1, B_2, ... of M such that every polynomial of M is expressible in the form R_1B_1+R_2B_2+..., where R_1, R_2, ... ...

A game for which each player has a different set of moves in any position. Every position in an impartial game has a nim-value.