Search Results for ""

An ordered finite configuration with certain pairs of points, called cables, which are constrained not to get further apart and certain other pairs of points, called struts, ...

A ternary tree is a tree-like structure that is rooted and in which each vertex has at most three children.

A tournament sequence is an increasing sequence of positive integers (t_1, t_2, ...) such that t_1=1 and t_(i+1)<=2t_i. Cook and Kleber (2000) show that Meeussen sequences ...

The trimean is defined to be TM=1/4(H_1+2M+H_2), where H_i are the hinges and M is the statistical median. Press et al. (1992) call this Tukey's trimean. It is an L-estimate.

A multiplicative character is called unitary if it has absolute value 1 everywhere.

The width of a box is the horizontal distance from side to side (usually defined to be greater than the depth, the horizontal distance from front to back).

A binary unit of information equal to 8 bits. Unfortunately, the storage of binary numbers in computers is not entirely standardized. Because computers store information in ...

Let {a_i}_(i=1)^n be a set of positive numbers. Then sum_(i=1)^n(a_1a_2...a_i)^(1/i)<=esum_(i=1)^na_i (which is given incorrectly in Gradshteyn and Ryzhik 2000). Here, the ...

Instead of picking two points from the interior of the cube, instead pick two points on different faces of the unit cube. In this case, the average distance between the ...

Given a Poisson distribution with rate of change lambda, the distribution of waiting times between successive changes (with k=0) is D(x) = P(X<=x) (1) = 1-P(X>x) (2) = ...