Search Results for ""

Let a_1=1 and define a_(n+1) to be the least integer greater than a_n which cannot be written as the sum of at most h>=2 addends among the terms a_1, a_2, ..., a_n. This ...

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

An independent edge set, also called a matching, of a graph G is a subset of the edges such that no two edges in the subset share a vertex in G. A maximum independent edge ...

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

The term "continued fraction" is used to refer to a class of expressions of which generalized continued fraction of the form b_0+(a_1)/(b_1+(a_2)/(b_2+(a_3)/(b_3+...))) ...

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) = ...