Search Results for ""

A triangular matrix L of the form L_(ij)={a_(ij) for i>=j; 0 for i<j. (1) Written explicitly, L=[a_(11) 0 ... 0; a_(21) a_(22) ... 0; | | ... 0; a_(n1) a_(n2) ... a_(nn)]. ...

It is conjectured that every tree with e edges whose nodes are all trivalent or monovalent can be given a "magic" labeling such that the integers 1, 2, ..., e can be assigned ...

Three circles packed inside a triangle such that each is tangent to the other two and to two sides of the triangle are known as Malfatti circles. The Malfatti configuration ...

The matrix direct sum of n matrices constructs a block diagonal matrix from a set of square matrices, i.e., direct sum _(i=1)^nA_i = diag(A_1,A_2,...,A_n) (1) = [A_1 ; A_2 ; ...

A sequence defined from a finite sequence a_0, a_1, ..., a_n by defining a_(n+1)=max_(i)(a_i+a_(n-i)).

A maximal sum-free set is a set {a_1,a_2,...,a_n} of distinct natural numbers such that a maximum l of them satisfy a_(i_j)+a_(i_k)!=a_m, for 1<=j<k<=l, 1<=m<=n.

A set having the largest number k of distinct residue classes modulo m so that no subset has zero sum.

The mean square displacement (MSD) of a set of N displacements x_n is given by <|x|^2>=sum_(k=1)^N|x_k|^2. It arises particularly in Brownian motion and random walk problems. ...

The minimum excluded value. The mex of a set S of nonnegative integers is the least nonnegative integer not in the set.

A sequence defined from a finite sequence a_0, a_1, ..., a_n by defining a_(n+1)=mex_(i)(a_i+a_(n-i)), where mex is the mex (minimum excluded value).