User:Trieu/Sub distance sequence

(Free project!)

A sub-distance sequence level-n F[n] of a sequence F is defined as following:

If F(k) is kth term of F, then F[n](k) is kth term of F[n] created by: F[n](k) = F(n+k+1) - F(k)

From here, one can expand the sub-distance sequence: Given a set Si = {Si-1 U ni}, S0={}.

F[Si] is said to be a sub-distance sequence level ni of F[Si-1] with F[Si](k) = F[Si-1](ni+k+1) - F[Si-1](k)

The first property is that: F[n1,n2](k)=F[n2,n1](k).

One practicing way of determining sequence F from the equation F[k](g(x)) = h(x), where k is constant, g, h are functions of variable x is: 

F will be contained k + 1 free parameters, say: a1,a2,...,ak+1.

If pj are the solutions of the equation g(x) = j (j>0), then F will take the form as below:

F(i) = $$\sum_{i=1}^{k+1} a_i$$, i<=k+1.

F(i) = h(pi-k-1) + F(i-k-1), i>k+1.

Sub-distance sequence holds similar properties as subsequence. It will be updated later on.