Search Results for ""
181 - 190 of 13134 for Order TheorySearch Results
The sporadic groups are the 26 finite simple groups that do not fit into any of the four infinite families of finite simple groups (i.e., the cyclic groups of prime order, ...
The procedure used in subtraction to "borrow" 10 from the next higher digit column in order to obtain a positive difference in the column in question.
An n×n magic square for which every pair of numbers symmetrically opposite the center sum to n^2+1. The Lo Shu is associative but not panmagic. The numbers of associative ...
A subgroup is a subset H of group elements of a group G that satisfies the four group requirements. It must therefore contain the identity element. "H is a subgroup of G" is ...
For x>0, J_0(x) = 2/piint_0^inftysin(xcosht)dt (1) Y_0(x) = -2/piint_0^inftycos(xcosht)dt, (2) where J_0(x) is a zeroth order Bessel function of the first kind and Y_0(x) is ...
There are no tilings of the equilateral triangle of side length 7 by all the polyhexes of order n=4. There are nine distinct solutions of all the polyhexes of order n=4 which ...
Let (A,<=) and (B,<=) be totally ordered sets. Let C=A×B be the Cartesian product and define order as follows. For any a_1,a_2 in A and b_1,b_2 in B, 1. If a_1<a_2, then ...
Given n sets of variates denoted {X_1}, ..., {X_n} , the first-order covariance matrix is defined by V_(ij)=cov(x_i,x_j)=<(x_i-mu_i)(x_j-mu_j)>, where mu_i is the mean. ...
The partial order width of a set P is equal to the minimum number of chains needed to cover P. Equivalently, if a set P of ab+1 elements is partially ordered, then P contains ...
Let (A,<=) be a well ordered set. Then the set {a in A:a<k} for some k in A is called an initial segment of A (Rubin 1967, p. 161; Dauben 1990, pp. 196-197; Moore 1982, pp. ...
...
View search results from all Wolfram sites (44093 matches)

