Search Results for ""
6291 - 6300 of 13135 for Computational GeometrySearch Results
A lattice which satisfies the identity (x ^ y) v (x ^ z)=x ^ (y v (x ^ z)) is said to be modular.
The important property of Fourier transforms that F_x[cos(2pik_0x)f(x)](k) can be expressed in terms of F[f(x)]=F(k) as follows, ...
A module homomorphism is a map f:M->N between modules over a ring R which preserves both the addition and the multiplication by scalars. In symbols this means that ...
The kernel of a module homomorphism f:M-->N is the set of all elements of M which are mapped to zero. It is the kernel of f as a homomorphism of additive groups, and is a ...
The rule (F,F=>G)/G, where => means "implies," which is the sole rule of inference in propositional calculus. This rule states that if each of F and F=>G is either an axiom ...
The partial differential equation (Cole and Cook 1986, p. 34; Zwillinger 1997, p. 134).
A mathematical object which consists of a set of a single element, making it a 1-tuple. The yin-yang is also known as the monad.
A shuffle in which cards from the top of the deck in the left hand are alternatively moved to the bottom and top of the deck in the right hand. If the deck is shuffled m ...
Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3u(u-1)(u-2) for n=2u; 2/3u(u-1)(4u+1) for n=4u+1; ...
A technically defined group characterizing a system of linear differential equations y_j^'=sum_(k=1)^na_(jk)(x)y_k for j=1, ..., n, where a_(jk) are complex analytic ...
...
View search results from all Wolfram sites (173967 matches)

