How many permutations are there in such that for all ?

For that problem, the answer was . The number of permutations on items where no item moves more than one space from where it started is the -th Fibonacci number. Now, the obvious question is: How many permutations are there in such that for and is an arbitrary positive integer?

Let’s not start so arbitrary just yet though…

Let’s just look for a moment at how much trickier things become when we let . It’s easy enough for . There’s only one shuffle possible and it satisfies the constraint. For that matter, the same is (conventionally) true for . When you have zero items, there is only one (very Zen) way to shuffle them, and it certainly does not violate the constraints.

For , there are two shuffles. Both satisfy the constraints. Similarly, with , there are shuffles. All of them satisfy the constraints.

For , we get to the first interesting case. Here, some of the shuffles violate the constraints. So, how many shuffles are still possible? To tackle this, we are going to use an inclusion-exclusion counting. The only items that could be out of place are the first and the last. So, how many of the shuffles have either the first element move to the back or the last element move to the front?

There are permutations that send the first element to the back. There are permutations that send the last element to the front. We might then think that there are valid shuffles. Alas, there are some shuffles that move both the first element to the back and the last element to the front. We have counted those twice. There are of those.

So, for , there are shuffles satisfying our constraint that .

What then of ? Well, it’s bedtime here. This is gonna have to wait.

Goodnight.

One nascent game concept that I have in my head requires me to do some constrained shuffling. As an example constraint, imagine that you need to shuffle a deck of cards while ensuring that no card moved more than five spots away from where it started. Or, imagine that you had to shuffle the deck so that a card of rank could only move to spot that had been held by a card of rank , , or .

In the general case, you have a directed graph with vertexes and a permutation such that can only equal if there is an edge in the graph from to .

Well, as this is for a game, it would get pretty boring if there were only a few possible shuffles. On the other hand, if there are a large number of possible shuffles, then I haven’t really restricted the shuffling at all for all practical purposes. So, then the question is: for a given directed graph, how many possible shuffles are there? Can I generate them without generating any of the invalid permutations, too?

Today, I started with the How many?-question. I started with a very simple graph. The vertexes are spaced evenly along an east-west line. Each vertex is connected only to itself, its nearest neighbor to the east, and its nearest neighbor to the west. Put another way, for .

Let’s say we already had a row of vertexes. If we add another vertex at the beginning of the row, then there are two things that a shuffle can do to that new vertex: leave it where it is or swap it with what had been the first vertex in the row. Now, suppose that is the count of valid shuffles for vertexes in this configuration. The case where our new vertex stays where it is leaves possibilities for the rest of the row. The case where our new vertex swaps places with the old first vertex leaves possibilities. As such, .

Cha-ching. Note that and , then where are the Fibonacci numbers.

Things get a great deal messier if we move up to . More on that some other time…