Search Results for ""

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

Minkowski's conjecture states that every lattice tiling of R^n by unit hypercubes contains two hypercubes that meet in an (n-1)-dimensional face. Minkowski first considered ...

The Miquel point is the point of concurrence of the Miquel circles. It is therefore the radical center of these circles. Let the points defining the Miquel circles be ...

If a points A^', B^', and C^' are marked on each side of a triangle DeltaABC, one on each side (or on a side's extension), then the three Miquel circles (each through a ...

A 2-dimensional discrete percolation model is said to be mixed if both graph vertices and graph edges may be "blocked" from allowing fluid flow (i.e., closed in the sense of ...

A modified spherical Bessel function of the second kind, also called a "spherical modified Bessel function of the first kind" (Arfken 1985) or (regrettably) a "modified ...

L_nu(z) = (1/2z)^(nu+1)sum_(k=0)^(infty)((1/2z)^(2k))/(Gamma(k+3/2)Gamma(k+nu+3/2)) (1) = (2(1/2z)^nu)/(sqrt(pi)Gamma(nu+1/2))int_0^(pi/2)sinh(zcostheta)sin^(2nu)thetadtheta, ...

The perspective image of an infinite checkerboard. It can be constructed starting from any triangle DeltaOXY, where OX and OY form the near corner of the floor, and XY is the ...

The moment of inertia with respect to a given axis of a solid body with density rho(r) is defined by the volume integral I=intrho(r)r__|_^2dV, (1) where r__|_ is the ...

Draw three circles in the plane, none of which lies completely inside another, and the common external tangent lines for each pair. Then points of intersection of the three ...