Decomposing a matrix into a sum of permutations

combinatoricspermutations

I have the following table where each row and column add to 100:

Position | A  | B  | C  |
---------+----+----+----+
1        | 20 | 50 | 30 |
2        | 30 | 20 | 50 |
3        | 50 | 30 | 20 |
---------+----+----+----+

I then need to create a value for each possible ordered combination of A,B,C (i.e. ABC, ACB, BAC, BCA, CAB, CBA) such that the above constraints are still met.

For example:

ABC relates to A in position 1, B in position 2 and C in position 3

and

ACB relates to A in position 1, C in position 2 and B in position 3

As these are the only two combinations that contain A in position 1 then the values for these two combinations should total 20 (position A1 in the table above).

But then ACB and BCA should total 50 as these are the only 2 combinations that contain C at position 2.

I'm not even sure if this is possible? I've tried simultaneous equations and think i'm finding more unknowns than equations which then means no solution right?

Anybody willing to take a stab at it and find a solution if ones exists?

Best Answer

Suppose $ABC = x$. Then we have:

$ABC + ACB = 20 \Rightarrow ACB = 20-x \\ ABC + CBA = 20 \Rightarrow CBA = 20-x \\ ABC + BAC = 20 \Rightarrow BAC = 20-x \\ BAC + BCA = 50 \Rightarrow BCA = 50-(20-x)=30+x \\ CBA + CAB = 30 \Rightarrow CAB = 30-(20-x)=10+x$

Pick any value you like for $x$ and you have a solution. If you want all values to be strictly positive then $0 < x < 20$.

Related Question