TOPICS
Search

Search Results for ""


201 - 210 of 292 for Jordan's_lemmaSearch Results
A block diagonal matrix, also called a diagonal block matrix, is a square diagonal matrix in which the diagonal elements are square matrices of any size (possibly even 1×1), ...
The word canonical is used to indicate a particular choice from of a number of possible conventions. This convention allows a mathematical object or class of objects to be ...
The three points determined on three coplanar edges of a tetrahedron by the external bisecting planes of the opposite dihedral angles are collinear. Furthermore, this line ...
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 ...
Let the absolute frequencies of occurrence of an event in a number of class intervals be denoted f_1, f_2, .... The cumulative frequency corresponding to the upper boundary ...
The operator partial^_ is defined on a complex manifold, and is called the 'del bar operator.' The exterior derivative d takes a function and yields a one-form. It decomposes ...
The endodocehedron, also called the concave pyrohedral dodecahedron, is the concave solid corresponding to the interior void formed when each face of a regular dodecahedron ...
Let T_n(x) be an arbitrary trigonometric polynomial T_n(x)=1/2a_0+{sum_(k=1)^n[a_kcos(kx)+b_ksin(kx)]} (1) with real coefficients, let f be a function that is integrable over ...
A graph G is fully reconstructible in C^d if the graph is determined from its d-dimensional measurement variety. If G is globally rigid in R^d on n>=d+2 vertices, then G is ...
A d-dimensional framework is a pair (G,p) where G=(V,E) is a graph with vertex set V and edge set E and p:V->R^d is a map that assigns a point in R^d to each vertex of G. The ...
1 ... 18|19|20|21|22|23|24 ... 30 Previous Next

...