# The Old Miss Gruppe

Miss Gruppe is growing too old for her house - there are far too many rooms and it sometimes takes her days to find her way between the pantry and the kitchen! In honor of her accomplishments in the field of mathematics, the townsfolk have decided to design her a brand new house, to suit her better in her old age.

In particular, they've come up with the following idea: The house will be organized into various rooms connected to each other by doors (as tends to be the case in houses). A room may have any number of doors, but it will always have one labeled as A and one labeled as B (with the labels facing inwards). Then, it will be easy to give instructions to get around the house - for instance:

To get from the pantry to the kitchen, go through door A. From that room, go through door B. Finally, using door A brings you to your destination.

They design the house so that it is possible to get from any room to any other by such a sequence of moves. One may note that instructions like:

To get from the bathroom to the dining room, use door A and from that room, use the next door labelled A.

make sense, as the door labelled A inside the bathroom is likely different from the door labelled A in the room into which the former door leads (i.e. the door labelled A in the bathroom might be unlabeled on the other side or labelled B on the other side).

However, they understand that Miss Gruppe is somewhat absent-minded and often wanders - though she can remember the instructions all right, sometimes she'll deviate from the path. But, as a matter of superstition, when she deviates, it will always be by repeating some sequence of moves through doors exactly $3$ times - so she might go through door A, then through the next door A, and then through the next door A or she might alternate "Use door A, use door B" exactly thrice. Thus, they have decided to design the house with the following additional property:

From any room, if you choose some sequence of door labels to go through and repeat it thrice, you will end up in the same room as you started.

The townspeople love Miss Gruppe very much and want to build her a house with as many rooms as possible subject to the above conditions. Miss Gruppe, who is still an avid climbed of stairs, is fine with the house having overpasses and tunnels and generally not fitting into a plane. How many rooms can such a house have?

Simple Example of such a house:

A simple design for such a house with $3$ rooms would be as follows, where the character * represents a door and a letter in an adjacent square represents a label.

+---+---+
|   |   |
|   |   |
|  A*B  |
|   |   |
|   | A |
|   +-*-+
|   | B |
|   |   |
|  B*A  |
|   |   |
|   |   |
+---+---+


Where one can, for instance, get from the long room to the bottom left room either by following door A twice or by following B once - but it is easy to see that following either door three times leads you back to your original location, and easy to see that sequences like "Follow A then A then B" lead one back to their original location when followed thrice.

• Are you certain that anything besides the "simple example" is possible? I've found it's impossible with 6 and 9 rooms. The only other potential set of solutions I've found have either 18 or 21 rooms, and although it's possible to get all rooms to admit some sequences with the specified property, or some rooms to admit all sequences with the specified property, I'm beginning to doubt it's possible to satisfy the property for all sequences for all rooms with anything more than 3 rooms. – COTO Jun 20 '15 at 1:54
• @COTO How did you determine it's impossible for 9 rooms? It's certainly possible for 9 - for instance, draw a 3x3 grid of rooms, with each room having doors to the four adjacent rooms ("wrapping" around edges - which can be physically realized with tunnels or something of that sort. Or a toroidal house). Label all upward doors A and all rightward doors B. This satisfies the condition. (It's not the biggest arrangement though) – Milo Brandt Jun 20 '15 at 2:01
• OK. I see what you mean. I was adding unnecessary restrictions to the problem. – COTO Jun 20 '15 at 2:10

Each finite sequence of letters from the set $\{A,B\}$ gives instructions for moving from one room to another, and so determines a permutation of the rooms in the house. Let $G$ denote the collection of all permutations arising this way, which is a group. The information we are given means that:
1. $G$ acts transitively on the rooms in the house,
2. $G$ is generated by the elements $A$ and $B$, and
3. every element of $G$ has order dividing $3$.
Condition 1 says that the number of rooms is bounded by the size of $G$. The largest group satisfying Conditions 2 and 3 is called the Burnside group $B(2,3)$, which has order $27$ (see here).
Below is an image of the Burnside group, which can also be interpretted as the largest house satisfying the desired conditions. This house has $27$ rooms. The black squares represent rooms. A yellow edge pointing from one room to another indicates door A leads from the first room to the second. Similarly, blue edges represent doors labelled B.