How Can Binary Vectors Be Ordered Through Transformation?

  • Thread starter Thread starter baxy
  • Start date Start date
  • Tags Tags
    Binary Vector
Click For Summary
The discussion centers on finding a transformation for a set of binary vectors (A, B, C) to establish a specific order based on transformation steps. The user seeks a method to define a relation where A > B > C, based on the number of steps required to convert one vector to another. Suggestions include using linear transformations to create an output vector that can be sorted to reflect the desired order. However, the challenge remains in determining how to quantify the transformations to maintain the correct order. The conversation highlights the need for a systematic approach to sorting binary vectors based on transformation steps.
baxy
Messages
2
Reaction score
0
Hi,

This is my first post and I must worn you that I'm not a mathematician. I am 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: 010110now 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:
Physics news on Phys.org
Hey baxy and welcome to the forums.

I'm not exactly sure what you are trying to do, but it seems that you're given a set T = {T1,T2,T3} and you want to find a transformation that takes T1,T2,T3 in which f(T1) > f(T2) > f(T3) or f(T1) < f(T2) < f(T3).

One easy transformation that comes to mind if we assume that all entries of the set are non-zero is to use a transformation that maps an input vector to an output vector. In other words, using your set with three elements define F to be:

F(T1,T2,T3) = [T1+T2+T3,T2+T3,T3] where the output is a vector with three elements.

Since this is a linear transformation, you can create an appropriate matrix that represents this transformation and define that as your operator.

Is this what you had in mind?

Also I didn't take into account the binary nature of your number, so you would have to compensate for this in your computation.
 
ok, but i didn't quite understand how can i from this output vector figure out that T1>T2>T3 ? so what i need t do is transform my vectors into something and then just by sorting the transforms, figure out that T1_{A} needs 1 transformation step to be converted to T2_{B} and 2 transformation step to be converted to T3_{C}.

This is my problem.
 
baxy said:
ok, but i didn't quite understand how can i from this output vector figure out that T1>T2>T3 ? so what i need t do is transform my vectors into something and then just by sorting the transforms, figure out that T1_{A} needs 1 transformation step to be converted to T2_{B} and 2 transformation step to be converted to T3_{C}.

This is my problem.

Ohh I see what you mean.

Well to sort two elements the first one is min(T1,T2) and the last is max(T1,T2). Can you adapt this for three elements?
 
Thread 'How to define a vector field?'
Hello! In one book I saw that function ##V## of 3 variables ##V_x, V_y, V_z## (vector field in 3D) can be decomposed in a Taylor series without higher-order terms (partial derivative of second power and higher) at point ##(0,0,0)## such way: I think so: higher-order terms can be neglected because partial derivative of second power and higher are equal to 0. Is this true? And how to define vector field correctly for this case? (In the book I found nothing and my attempt was wrong...

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 33 ·
2
Replies
33
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 43 ·
2
Replies
43
Views
7K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K