- #1

- 2

- 0

Hi,

This is my first post and I must worn you that I'm not a mathematician. Im just a regular blonk looking for help concerning the following problem.

What i have is a set (T) of binary vectors:

A: 100110

B: 000110

C: 010110

now what i am trying to figure out is there a transformation, a function to transform given vectors in such a way that

A>B>C

where a relation > on T is given by the fact that to convert

B->A takes 1 step

C->A takes 2 steps

C->B takes 1 step

Can anyone suggest a book or a paper where such things are discussed , or give a few pointers?

Thank you,

baxy

PS

and the relation can ba symmetrical

A<B<C

as long as the order is preserved

This is my first post and I must worn you that I'm not a mathematician. Im just a regular blonk looking for help concerning the following problem.

What i have is a set (T) of binary vectors:

A: 100110

B: 000110

C: 010110

now what i am trying to figure out is there a transformation, a function to transform given vectors in such a way that

A>B>C

where a relation > on T is given by the fact that to convert

B->A takes 1 step

C->A takes 2 steps

C->B takes 1 step

Can anyone suggest a book or a paper where such things are discussed , or give a few pointers?

Thank you,

baxy

PS

and the relation can ba symmetrical

A<B<C

as long as the order is preserved

Last edited: