Search Results for ""

A principal bundle is a special case of a fiber bundle where the fiber is a group G. More specifically, G is usually a Lie group. A principal bundle is a total space E along ...

The tetrix is the three-dimensional analog of the Sierpiński sieve illustrated above, also called the Sierpiński sponge or Sierpiński tetrahedron. The nth iteration of the ...

A knot property, also called the twist number, defined as the sum of crossings p of a link L, w(L)=sum_(p in C(L))epsilon(p), (1) where epsilon(p) defined to be +/-1 if the ...

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...

Legendre showed that there is no rational algebraic function which always gives primes. In 1752, Goldbach showed that no polynomial with integer coefficients can give a prime ...

The entire function B(z) = [(sin(piz))/pi]^2[2/z+sum_(n=0)^(infty)1/((z-n)^2)-sum_(n=1)^(infty)1/((z+n)^2)] (1) = 1-(2sin^2(piz))/(pi^2z^2)[z^2psi_1(z)-z-1], (2) where ...

If f has no spectrum in [-lambda,lambda], then ||f||_infty<=pi/(2lambda)||f^'||_infty (1) (Bohr 1935). A related inequality states that if A_k is the class of functions such ...

The function defined by the contour integral J_(n,k)(z) =1/(2pii)int^((0+))t^(-n-1)(t+1/t)^kexp[1/2z(t-1/t)]dt, where int_((0+)) denotes the contour encircling the point z=0 ...

The three points determined on three coplanar edges of a tetrahedron by the external bisecting planes of the opposite dihedral angles are collinear. Furthermore, this line ...

Given a set of linear equations {a_1x+b_1y+c_1z=d_1; a_2x+b_2y+c_2z=d_2; a_3x+b_3y+c_3z=d_3, (1) consider the determinant D=|a_1 b_1 c_1; a_2 b_2 c_2; a_3 b_3 c_3|. (2) Now ...