Search Results for ""

An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...

An n×n-matrix A is said to be diagonalizable if it can be written on the form A=PDP^(-1), where D is a diagonal n×n matrix with the eigenvalues of A as its entries and P is a ...

A board covered by a lattice of pegs around which one can span rubber bands to form segments and polygons. It was invented by the Egyptian mathematician and pedagogist Caleb ...

A topology that is "potentially" a metric topology, in the sense that one can define a suitable metric that induces it. The word "potentially" here means that although the ...

Noncommutative topology is a recent program having important and deep applications in several branches of mathematics and mathematical physics. Because every commutative ...

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...

Curves which, when rotated in a square, make contact with all four sides. Such curves are sometimes also known as rollers. The "width" of a closed convex curve is defined as ...

The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through the theorem of Wagner (1937) that graphs ...

Slater (1960, p. 31) terms the identity _4F_3[a,1+1/2a,b,-n; 1/2a,1+a-b;1+a+n]=((1+a)_n(1/2+1/2a-b)_n)/((1/2+1/2a)_n(1+a-b)_n) for n a nonnegative integer the "_4F_3[1] ...