Search Results for ""

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.

A set of sample problems in unconstrained optimization is given by loading Optimization`UnconstrainedProblems` and evaluating $FindMinimumProblems.

The symbol union , used for the union of sets, and, sometimes, also for the logical connective OR instead of the symbol v (vee). In fact, for any two sets A and B x in A ...

A set partition of the rational numbers into two nonempty subsets S_1 and S_2 such that all members of S_1 are less than those of S_2 and such that S_1 has no greatest ...

Let S be a nonempty set of real numbers that has a lower bound. A number c is the called the greatest lower bound (or the infimum, denoted infS) for S iff it satisfies the ...

Let S be a nonempty set of real numbers that has an upper bound. Then a number c is called the least upper bound (or the supremum, denoted supS) for S iff it satisfies the ...

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 ...