Search Results for ""

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

The regular octahedron, often simply called "the" octahedron, is the Platonic solid with six polyhedron vertices, 12 polyhedron edges, and eight equivalent equilateral ...

Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...

A busy beaver is an n-state, 2-color Turing machine which writes a maximum number Sigma(n) of 1s before halting (Rado 1962; Lin and Rado 1965; Shallit 1998). Alternatively, ...

There are many unsolved problems in mathematics. Some prominent outstanding unsolved problems (as well as some which are not necessarily so well known) include 1. The ...

The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.

An anchor is the bundle map rho from a vector bundle A to the tangent bundle TB satisfying 1. [rho(X),rho(Y)]=rho([X,Y]) and 2. [X,phiY]=phi[X,Y]+(rho(X)·phi)Y, where X and Y ...

A sequence of polynomials p_n satisfying the identities p_n(x+y)=sum_(k>=0)(n; k)p_k(x)p_(n-k)(y).

An axiomatic theory (such as a geometry) is said to be complete if each valid statement in the theory is capable of being proven true or false.

The slicing of a three-dimensional object by a plane (or more general slice).