Search Results for ""

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 ...

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 ...

The Császár polyhedron is a polyhedron that is topologically equivalent to a torus which was discovered in the late 1940s by Ákos Császár (Gardner 1975). It has 7 polyhedron ...

A general space based on the line element ds=F(x^1,...,x^n;dx^1,...,dx^n), with F(x,y)>0 for y!=0 a function on the tangent bundle T(M), and homogeneous of degree 1 in y. ...

The internal (external) bisecting plane of a dihedral angle of a tetrahedron divides the opposite edge in the ratio of the areas of the adjacent faces.

The construction of polyhedra using identical building blocks. The illustrations above show such constructions for the cuboctahedron, octahedron rhombic dodecahedron, and ...