TOPICS
Search

Search Results for ""


51 - 60 of 1392 for Linear programmingSearch Results
Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...
The double covering group of the (linear) symplectic group.
A nonsingular linear map A:R^n->R^n is orientation-reversing if det(A)<0.
A real-linear vector space H equipped with a symplectic form s.
Predictability at a time tau in the future is defined by (R(x(t),x(t+tau)))/(H(x(t))), and linear predictability by (L(x(t),x(t+tau)))/(H(x(t))), where R and L are the ...
Given a 111×111 (0,1)-matrix, fill 11 spaces in each row in such a way that all columns also have 11 spaces filled. Furthermore, each pair of rows must have exactly one ...
A linear combination of basis quaternions with integer coefficients.
A nonsingular linear map A:R^n->R^n is orientation-preserving if det(A)>0.
An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...
A linear functional defined on a subspace of a vector space V and which is dominated by a sublinear function defined on V has a linear extension which is also dominated by ...
1 ... 3|4|5|6|7|8|9 ... 140 Previous Next

...