TOPICS
Search

Search Results for ""


8831 - 8840 of 13134 for index theoremSearch Results
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a join-homomorphism provided that for any x,y in L, h(x v y)=h(x) v h(y). It is also ...
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a join-isomorphism if it preserves joins.
Jonquière's relation, sometimes also spelled "Joncquière's relation" (Erdélyi et al. 1981, p. 31), states ...
A nonassociative algebra named after physicist Pascual Jordan which satisfies xy=yx (1) and (xx)(xy)=x((xx)y)). (2) The latter is equivalent to the so-called Jordan identity ...
A matrix, also called a canonical box matrix, having zeros everywhere except along the diagonal and superdiagonal, with each element of the diagonal consisting of a single ...
The Jordan canonical form, also called the classical canonical form, of a special type of block matrix in which each block consists of Jordan blocks with possibly differing ...
Let M be a bounded set in the plane, i.e., M is contained entirely within a rectangle. The outer Jordan measure of M is the greatest lower bound of the areas of the coverings ...
If mu is a real measure (i.e., a measure that takes on real values), then one can decompose it according to where it is positive and negative. The positive variation is ...
Jordan's lemma shows the value of the integral I=int_(-infty)^inftyf(x)e^(iax)dx (1) along the infinite upper semicircle and with a>0 is 0 for "nice" functions which satisfy ...
The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...
1 ... 881|882|883|884|885|886|887 ... 1314 Previous Next

...