Search Results for ""

A sequence {a_n}_(n=1)^N forms a (binary) heap if it satisfies a_(|_j/2_|)<=a_j for 2<=j<=N, where |_x_| is the floor function, which is equivalent to a_i<a_(2i) and ...

The orthogonal decomposition of a matrix into lower trapezoidal matrices.

A minimization of the maximum error for a fixed number of terms.

A sum in which subsequent terms cancel each other, leaving only initial and final terms. For example, S = sum_(i=1)^(n-1)(a_i-a_(i+1)) (1) = ...

A transpose of a doubly indexed object is the object obtained by replacing all elements a_(ij) with a_(ji). For a second-tensor rank tensor a_(ij), the tensor transpose is ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex ...

The number one (1), also called "unity," is the first positive integer. It is an odd number. Although the number 1 used to be considered a prime number, it requires special ...

Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and ...

The approximation problem is a well known problem of functional analysis (Grothendieck 1955). It asks to determine whether every compact operator T from a Banach space X to a ...

An equation for a lattice sum b_3(1) (Borwein and Bailey 2003, p. 26) b_3(1) = sum^'_(i,j,k=-infty)^infty((-1)^(i+j+k))/(sqrt(i^2+j^2+k^2)) (1) = ...