Search Results for ""

The complete elliptic integral of the second kind, illustrated above as a function of k, is defined by E(k) = E(1/2pi,k) (1) = ...

A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with n graph vertices is denoted K_n and has (n; 2)=n(n-1)/2 (the ...

A method of computing the determinant of a square matrix due to Charles Dodgson (1866) (who is more famous under his pseudonym Lewis Carroll). The method is useful for hand ...

A reduction system is called confluent (or globally confluent) if, for all x, u, and w such that x->_*u and x->_*w, there exists a z such that u->_*z and w->_*z. A reduction ...

A conical frustum is a frustum created by slicing the top off a cone (with the cut made parallel to the base). For a right circular cone, let s be the slant height and R_1 ...

The homomorphism S which, according to the snake lemma, permits construction of an exact sequence (1) from the above commutative diagram with exact rows. The homomorphism S ...

Contour integration is the process of calculating the values of a contour integral around a given contour in the complex plane. As a result of a truly amazing property of ...

A contravariant tensor is a tensor having specific transformation properties (cf., a covariant tensor). To examine the transformation properties of a contravariant tensor, ...

The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted ...

Conway's knot is the prime knot on 11 crossings with braid word sigma_2^3sigma_1sigma_3^(-1)sigma_2^(-2)sigma_1sigma_2^(-1)sigma_1sigma_3^(-1). The Jones polynomial of ...