Search Results for ""

Find the surface enclosing the maximum volume per unit surface area, I=V/S. The solution is a sphere, which has I_(sphere)=(4/3pir^3)/(4pir^2)=1/3r. The fact that a sphere ...

An isozonohedron is a zonohedron whose faces consist of n(n-1) congruent rhombi (Fedorov 1953, pp. 256-266; Chilton and Coxeter 1963). The following table summarizes some of ...

A finite set of contraction maps w_i for i=1, 2, ..., N, each with a contractivity factor s<1, which map a compact metric space onto itself. It is the basis for fractal image ...

An iterated map is a map that is applied repeatedly to an object. The Wolfram Language function NestList[f, expr, n] gives a list of the results of iterating the function f n ...

The repeated application of a transformation.

A sequence {a_j} of positive integers is called an iteration sequence if there exists a strictly increasing sequence {s_k} of positive integers such that a_1=s_1>=2 and ...

Let W(u) be a Wiener process. Then where V_t=f(W(t),tau) for 0<=tau=T-t<=T, and f in C^(2,1)((0,infty)×[0,T]). Note that while Ito's lemma was proved by Kiyoshi Ito (also ...

The dimension d of any irreducible representation of a group G must be a divisor of the index of each maximal normal Abelian subgroup of G. Note that while Itô's theorem was ...

The Ivanov-Ivanov-Faradjev graph is a distance-regular graph on 990 vertices (Brouwer et al. 1989, p. 369). It has intersection array {7,6,4,4,4,1,1,1;1,1,1,2,4,4,6,7} and is ...

Let S be a mathematical statement, then the Iverson bracket is defined by [S]={0 if S is false; 1 if S is true, (1) and corresponds to the so-called characteristic function. ...