Search Results for ""

On a Riemannian manifold M, there is a canonical connection called the Levi-Civita connection (pronounced lē-vē shi-vit-e), sometimes also known as the Riemannian connection ...

The paradox of a man who states "I am lying." If he is lying, then he is telling the truth, and vice versa. Another version of this paradox is the Epimenides paradox. Such ...

Consider a reference triangle DeltaABC and externally inscribe a square on the side BC. Now join the new vertices S_(AB) and S_(AC) of this square with the vertex A, marking ...

In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...

Let there be three polynomials a(x), b(x), and c(x) with no common factors such that a(x)+b(x)=c(x). Then the number of distinct roots of the three polynomials is one or more ...

Matrix diagonalization is the process of taking a square matrix and converting it into a special type of matrix--a so-called diagonal matrix--that shares the same fundamental ...

A deconvolution algorithm (sometimes abbreviated MEM) which functions by minimizing a smoothness function ("entropy") in an image. Maximum entropy is also called the ...

There are two different definitions of the mid-arc points. The mid-arc points M_(AB), M_(AC), and M_(BC) of a triangle DeltaABC as defined by Johnson (1929) are the points on ...

The point on a line segment dividing it into two segments of equal length. The midpoint of a line segment is easy to locate by first constructing a lens using circular arcs, ...

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