Search Results for ""

The Eberlein polynomials of degree 2k and variable x are the orthogonal polynomials arising in the Johnson scheme that may be defined by E_k^((n,v))(x) = ...

The bias of an estimator theta^~ is defined as B(theta^~)=<theta^~>-theta. (1) It is therefore true that theta^~-theta = (theta^~-<theta^~>)+(<theta^~>-theta) (2) = ...

The problem of finding in how many ways E_n a plane convex polygon of n sides can be divided into triangles by diagonals. Euler first proposed it to Christian Goldbach in ...

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.

A Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A graph that is not Hamiltonian is said to be nonhamiltonian. A Hamiltonian ...

The hexanacci constant is the limiting ratio of adjacent hexanacci numbers. It is the algebraic number P = (x^6-x^5-x^4-x^3-x^2-x-1)_2 (1) = 1.98358284342... (2) (OEIS ...

A homology class in a singular homology theory is represented by a finite linear combination of geometric subobjects with zero boundary. Such a linear combination is ...

The system of ordinary differential equations (dm)/(dt) = lambdamxm+gammax1 (1) (dgamma)/(dt) = lambdagammaxm. (2)

The north pole is the point on a sphere with maximum z-coordinate for a given coordinate system. For a rotating sphere like the Earth, the natural coordinate system is ...

Given four points, A, B, C, and H, let H be the orthocenter of DeltaABC. Then A is the orthocenter DeltaHBC, B is the orthocenter of DeltaHAC, and C is the orthocenter of ...