How Can Binary Vectors Be Ordered Through Transformation?

  • Context: Undergrad 
  • Thread starter Thread starter baxy
  • Start date Start date
  • Tags Tags
    Binary Vector
Click For Summary

Discussion Overview

The discussion revolves around the problem of ordering a set of binary vectors through transformations. Participants explore potential functions or transformations that could establish a specific order among the vectors based on the number of transformation steps required to convert one vector to another.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant, baxy, seeks help in finding a transformation that allows for ordering binary vectors A, B, and C based on the number of steps required to convert between them.
  • Another participant suggests a linear transformation that could map the input vectors to an output vector, but notes that the binary nature of the vectors needs to be considered in the computation.
  • Baxy expresses confusion about how to determine the order from the output vector and emphasizes the need to sort the transformations to establish the relationship between the vectors.
  • A later reply proposes using minimum and maximum functions to sort two elements and asks if this can be adapted for three elements.

Areas of Agreement / Disagreement

Participants have not reached a consensus on the method to achieve the desired ordering of the binary vectors, and there are multiple competing views on how to approach the problem.

Contextual Notes

There are limitations regarding the assumptions about the binary nature of the vectors and the specific transformations that can be applied. The discussion does not resolve how to effectively sort the transformations or establish a clear ordering among the vectors.

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?
 

Similar threads

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