Search Results for ""

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

Conway's soldiers, also known as the "solitaire army" game (Berlekamp et al. 1982) or "checker-jumping problem" (Honsberger 1976) is a one-player game played on an infinite ...

A copositive matrix is a real n×n square matrix A=(a_(ij)) that makes the corresponding quadratic form f(x)=x^(T)Ax nonnegative for all nonnegative n-vectors x. Copositive ...

The cross polytope beta_n is the regular polytope in n dimensions corresponding to the convex hull of the points formed by permuting the coordinates (+/-1, 0, 0, ..., 0). A ...

Given a number z, the cube root of z, denoted RadicalBox[z, 3] or z^(1/3) (z to the 1/3 power), is a number a such that a^3=z. The cube root is therefore an nth root with ...

Deck transformations, also called covering transformations, are defined for any cover p:A->X. They act on A by homeomorphisms which preserve the projection p. Deck ...

The Dejter graph is a weakly regular graph on 112 vertices and 336 edges with regular paremeters (nu,k,lambda,mu)=(112,6,0,(0,1,2)). It can be obtained by deleting a copy of ...

A diagonal matrix is a square matrix A of the form a_(ij)=c_idelta_(ij), (1) where delta_(ij) is the Kronecker delta, c_i are constants, and i,j=1, 2, ..., n, with no implied ...

A convex polyomino containing at least one edge of its minimal bounding rectangle. The perimeter and area generating function for directed polygons of width m, height n, and ...

In order to find integers x and y such that x^2=y^2 (mod n) (1) (a modified form of Fermat's factorization method), in which case there is a 50% chance that GCD(n,x-y) is a ...