Hey!(adsbygoogle = window.adsbygoogle || []).push({});

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!

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Combinatorial design problem

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads - Combinatorial design problem | Date |
---|---|

Generalization of combinatorial generating functions? | Dec 31, 2014 |

Combinatorial Number Theory Problem | Apr 25, 2012 |

How do i construct a design matrix for a least square problem? | Sep 5, 2011 |

A seemingly simple combinatorial problem | Sep 22, 2009 |

Combinatorial Matrix problem - REALLY NEAT! | Jan 23, 2008 |

**Physics Forums - The Fusion of Science and Community**