Search Results for ""

Let two points x and y be picked randomly from a unit n-dimensional hypercube. The expected distance between the points Delta(n), i.e., the mean line segment length, is then ...

y^(n/m)+c|x/a|^(n/m)-c=0, with n/m>2. If n/m<2, the curve is a hypoellipse.

The analytic summation of a hypergeometric series. Powerful general techniques of hypergeometric summation include Gosper's algorithm, Sister Celine's method, Wilf-Zeilberger ...

Given a hypergeometric series sum_(k)c_k, c_k is called a hypergeometric term (Koepf 1998, p. 12).

A generalization of the matrix to an n_1×n_2×... array of numbers.

The term "hyperoctahedron" may refer to the 16-cell polytope in 4 dimensions, or more generally to an n-dimensional cross polytope.

A d-hyperoctant is one of the 2^d regions of space defined by the 2^d possible combinations of signs (+/-,+/-,...,+/-). The 2-hyperoctant is known as a quadrant and the ...

Let a_1, a_2, ..., a_n be scalars not all equal to 0. Then the set S consisting of all vectors X=[x_1; x_2; |; x_n] in R^n such that a_1x_1+a_2x_2+...+a_nx_n=c for c a ...

A hyperstring is a simple semi-Hamiltonian acyclic digraph (V,E) with a labeling of the edges in E such that, for all vertices i,j,p,q in V, either pi(i,j)=pi(p,q) or pi(i,j) ...

A generalization of an ordinary two-dimensional surface embedded in three-dimensional space to an (n-1)-dimensional surface embedded in n-dimensional space. A hypersurface is ...