Search Results for ""
9221 - 9230 of 13135 for science historySearch Results

A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c ...
A partially ordered set (or poset) is a set taken together with a partial order on it. Formally, a partially ordered set is defined as an ordered pair P=(X,<=), where X is ...
The number of partitions of n with k or fewer addends, or equivalently, into partitions with no element greater than k. This function is denoted q(n,k) or q_k(n). (Note that ...
Given a smooth manifold M with an open cover U_i, a partition of unity subject to the cover U_i is a collection of smooth, nonnegative functions psi_i, such that the support ...
The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...
Three types of n×n matrices can be obtained by writing Pascal's triangle as a lower triangular matrix and truncating appropriately: a symmetric matrix S_n with (S)_(ij)=(i+j; ...
The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...
Two knots are pass equivalent if there exists a sequence of pass moves taking one to the other. Every knot is either pass equivalent to the unknot or trefoil knot. These two ...
A patch (also called a local surface) is a differentiable mapping x:U->R^n, where U is an open subset of R^2. More generally, if A is any subset of R^2, then a map x:A->R^n ...
A path gamma is a continuous mapping gamma:[a,b]|->C^0, where gamma(a) is the initial point, gamma(b) is the final point, and C^0 denotes the space of continuous functions. ...

...