TOPICS
Search

Search Results for ""


7791 - 7800 of 13135 for Book GraphSearch Results
The companion matrix to a monic polynomial a(x)=a_0+a_1x+...+a_(n-1)x^(n-1)+x^n (1) is the n×n square matrix A=[0 0 ... 0 -a_0; 1 0 ... 0 -a_1; 0 1 ... 0 -a_2; | | ... ... |; ...
Suppose <= is a partial ordering on a nonempty set A. Then the elements a,b in A are said to be comparable provided a<=b or b<=a. Because two elements in a partially ordered ...
A tool with two arms joined at their ends which can be used to draw circles. In geometric constructions, the classical Greek rules stipulate that the compass cannot be used ...
Given a set S with a subset E, the complement (denoted E^' or E^_) of E with respect to S is defined as E^'={F:F in S,F not in E}. (1) Using set difference notation, the ...
If k is the elliptic modulus of an elliptic integral or elliptic function, then k^'=sqrt(1-k^2) (1) is called the complementary modulus. Complete elliptic integrals with ...
A complemented lattice is an algebraic structure (L, ^ , v ,0,1,^') such that (L, ^ , v ,0,1) is a bounded lattice and for each element x in L, the element x^' in L is a ...
A partially ordered set (or ordered set or poset for short) (L,<=) is called a complete lattice if every subset M of L has a least upper bound (supremum, supM) and a greatest ...
A surface which is simultaneously complete and minimal. There have been a large number of fundamental breakthroughs in the study of such surfaces in recent years, and they ...
A set of orthogonal functions {phi_n(x)} is termed complete in the closed interval x in [a,b] if, for every piecewise continuous function f(x) in the interval, the minimum ...
The complete products of a Boolean algebra of subsets generated by a set {A_k}_(k=1)^p of cardinal number p are the 2^p Boolean functions B_1B_2...B_p=B_1 intersection B_2 ...
1 ... 777|778|779|780|781|782|783 ... 1314 Previous Next

...