Search Results for ""

Möbius tetrahedra, also called Möbius tetrads (Baker 1922, pp. 61-62) are a pair of tetrahedra, each of which has all the vertices lying on the faces of the other: in other ...

Let a in C and |a|<1, then phi_a(z)=(z-a)/(1-a^_z) is a Möbius transformation, where a^_ is the complex conjugate of a. phi_a is a conformal mapping self-map of the unit disk ...

Write down the positive integers in row one, cross out every k_1th number, and write the partial sums of the remaining numbers in the row below. Now cross off every k_2th ...

Given a random variable x and a probability density function P(x), if there exists an h>0 such that M(t)=<e^(tx)> (1) for |t|<h, where <y> denotes the expectation value of y, ...

The nth raw moment mu_n^' (i.e., moment about zero) of a distribution P(x) is defined by mu_n^'=<x^n>, (1) where <f(x)>={sumf(x)P(x) discrete distribution; intf(x)P(x)dx ...

The moment problem, also called "Hausdorff's moment problem" or the "little moment problem," may be stated as follows. Given a sequence of numbers {mu_n}_(n=0)^infty, under ...

A second-order partial differential equation of the form Hr+2Ks+Lt+M+N(rt-s^2)=0, (1) where H, K, L, M, and N are functions of x, y, z, p, and q, and r, s, t, p, and q are ...

The point of concurrence of the six planes in Monge's tetrahedron theorem.

The six planes through the midpoints of the edges of a tetrahedron and perpendicular to the opposite edges concur in a point known as the Monge point.

A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex ...