Search Results for ""

The recurrence relation E_n=E_2E_(n-1)+E_3E_(n-2)+...+E_(n-1)E_2 which gives the solution to Euler's polygon division problem.

A set of integers that give the orders of the blocks in a Jordan canonical form, with those integers corresponding to submatrices containing the same latent root bracketed ...

For any real number r>=0, an irrational number alpha can be approximated by infinitely many rational fractions p/q in such a way that ...

The Seiberg-Witten equations are D_Apsi = 0 (1) F_A^+ = -tau(psi,psi), (2) where tau is the sesquilinear map tau:W^+×W^+->Lambda^+ tensor C.

For K a given knot in S^3, choose a Seifert surface M^2 in S^3 for K and a bicollar M^^×[-1,1] in S^3-K. If x in H_1(M^^) is represented by a 1-cycle in M^^, let x^+ denote ...

A matrix A for which A^(H)=A^(T)^_=A, where the conjugate transpose is denoted A^(H), A^(T) is the transpose, and z^_ is the complex conjugate. If a matrix is self-adjoint, ...

A 10-digit number satisfying the following property. Number the digits 0 to 9, and let digit n be the number of ns in the number. There is exactly one such number: 6210001000.

A polyhedron that is dual to itself. For example, the tetrahedron is self-dual. Naturally, the skeleton of a self-dual polyhedron is a self-dual graph. Pyramids are ...

A mapping of a domain F:U->U to itself.

Let h be the number of sides of certain skew polygons (Coxeter 1973, p. 15). Then h=(2(p+q+2))/(10-p-q).