## Wedding Planning and the Ménage Problem

Last month I wrote a wedding-themed post on some statistics behind the show Four Weddings. Now, fully refreshed from my own two week honeymoon, I would like to take some time to discuss some other areas of intersection between weddings and mathematics.

One of the things I most looked forward to during the planning of our wedding was the determination of the seating chart. Searching for an optimal arrangement given peoples’ preferences to sit next to their friends and away from their enemies was a fun little challenge. In the end, though, perhaps I made things too easy on myself. Although I assigned people to specific tables, I did not assign seats within the tables themselves. Instead, people were free to sit however they chose once they found their table.

An example of our seating. Hat tip to Dave Gilbert for the shot!

Were I truly a glutton for punishment, I would have assigned seats at each table. And were I a traditionalist, I would have arranged the seating so that couples were separated, and genders alternated. In other words, more traditional etiquette would dictate that at each table, the seats alternate from boy to girl to boy to girl (and so on), so that no two people who sit next to each other are in a relationship. While these additional restrictions would have complicated my job, they would have also opened the door to some nice mathematics. More specifically: if I had imposed these restrictions, in how many ways could I have seated people at a particular table?

Though our wedding was recent, this problem dates back to the 19th century. It is now commonly referred to as the “Ménage problem,” or, less titillatingly, the “Married Couples Problem." The solution to this problem is a formula which tells us in how many ways *n* couples can be seated at a round table so that (a) the genders alternate, and (b) no two people in a couple are seated next to each other. A derivation of the formula can be found here; the conclusion is that the number of ways to seat *n* couples at a round table in a way that would satisfy Ms. Manners, if denoted by the symbol *M _{n}*, is given by the formula

(As outlined in earlier posts, , and *n*! denotes the product of all the whole numbers from 1 up to *n*.) In the case of our wedding, where each table could seat 10 people (or 5 couples), this amounts to a total of

*M*_{5} = 2 · 5! (5! – 10 · 4! + 35 · 3! – 50 · 2! + 25 · 1! – 2 · 0!)

= 240(120 – 240 + 210 – 100 + 25 – 2)

= 28800 – 57600 + 50400 – 24000 + 6000 – 480 = 3120.

In other words, there are 3,120 ways to seat 5 couples at a round table subject to the restrictions (a) and (b) given above.

Why does this formula work? While a rigorous proof is provided at the page linked above, let me try to give a discussion that is less concerned with the details. First, suppose you ignored condition (b) and only wanted to count the number of ways you could seat people at a table so that men and women alternated. There are two ways to start the alternation, since the first seat can be filled by either a man or a woman; once this choice has been made, there are *n*! ways to seat the men, and *n*! ways to seat the women, so the total number of ways to seat people is 2 · *n*!^{2}. In particular, for 5 couples, 5! = 120, so this expression yields a value of 2 × 120 × 120 = 28,800. Note that this number, not coincidentally, appears in the calculation above.

28,800 is much larger than the true answer of 3,120. The reason, of course, is that we have ignored the restriction that no couples sit together, and we have therefore over-counted the number of possible configurations. So let us now try to remedy the situation. One thing we can do is try to subtract out the number of ways we can have a seating arrangement with one couple seated together — by eliminating these cases from our count, we should end up with a more reliable count, right?

How many ways can we arrange things so that a couple is guaranteed to sit together? Well, first we must choose the couple (5 ways to do this). Then we must decide how to start the male/female alternation of seats, just as in the previous case (2 ways to do this). Then we must choose where to seat the couple we have chosen to put together (10 ways to do this), and from there we must decide where to seat the remaining four men (4! ways to do this) and four women (4! ways to do this). Therefore, the number we want to subtract out (by the fundamental counting principle) is 5 × 2 × 10 × 4! × 4! = 57,600. Notice the appearance of this number in our earlier calculation as well.

But this can’t be right, because 28,800 – 57,600 is negative! While we’ve subtracted, it turns out we’ve subtracted too much. What we’re witnessing here is an example of the inclusion-exclusion principle, and this principle is what lies behind the alternating positive and negative signs in the expression 28800 – 57600 + 50400 – 24000 + 6000 – 480.

As it turns out, what we need to do is add in the number of ways we can arrange things so that two couples are guaranteed to sit together (50,400 ways). This will once again lead to a number that is too high, so we must subtract out the number of ways we can arrange things so that three couples are guaranteed to sit together (24,000 ways). This, in turn, will lead to a number that is too low, so we must add in the number of ways we can arrange things so that four couples are guaranteed to sit together (6,000 ways), and, as it turns out, this number will be too high, so we must finally subtract out the number of ways we can arrange things so that all five couples are guaranteed to sit together (480 ways). Only then will we have the right answer.

The inclusion-exclusion principle can be understood in certain cases with the use of Venn diagrams (see the linked Wikipedia article for more information).

Of course, we live in the 21st century — it’s not necessarily true that everyone will come to a wedding with a date, and for those that do, there is no guarantee that the date will be of the opposite sex! In fact, if one has a table with an equal number of same-sex male couples and same-sex female couples, any table arrangement in which genders alternate will automatically fulfill the condition that no couples sit next to each other. This raises a question, which I will leave you with for now: suppose a round table is to be arranged so that it will sit *n* same-sex male couples, *n* same-sex female couples, and *m* heterosexual couples. In how many ways can the seats be arranged so that conditions (a) and (b) written above remain satisfied?