Register to reply

Combinatorial design problem

by Constantinos
Tags: combinatorial, design, matrix
Share this thread:
Constantinos
#1
Nov13-12, 12:36 PM
P: 78
Hey!

I have a certain problem. Let M ≥ 4 be an even number and consider the set [0,1,...[itex]\frac{M}{2}[/itex]-1]. The problem is to put those numbers two times in each row of an M x (M choose 2) matrix, such that all possible combinations of entries that contain a pair of the same number occur just once.

For example, M = 4 it can be trivially seen that the matrix will be:

[0 0 1 1;
0 1 0 1;
0 1 1 0;
1 0 0 1;
1 0 1 0;
1 1 0 0]

Indeed all possible combinations of entries that contain 0 in a row, occur just once. This is also true for all possible combinations of entries that contain the number 1.

For M = 6 though, things get much more difficult. Is there an algorithm that can produce such matrices for arbitrary M? Does such a matrix even exist? Any papers or other info? Thanks!
Phys.Org News Partner Science news on Phys.org
Suddenly, the sun is eerily quiet: Where did the sunspots go?
'Moral victories' might spare you from losing again
Mammoth and mastodon behavior was less roam, more stay at home

Register to reply

Related Discussions
Combinatorial problem General Math 0
1st combinatorial problem Precalculus Mathematics Homework 3
4th Combinatorial problem Precalculus Mathematics Homework 2
3rd Combinatorial problem Precalculus Mathematics Homework 1
2nd combinatorial problem Precalculus Mathematics Homework 2