Here is a more relative way to represent a permutation with the same economical number of bits.
Here is a way to represent a permutation with a fairly economical number of bits.
There is a Jordan curve such that every piecewise-linear path from the inside to the outside intersects the curve infinitely many times. I describe how to draw such a curve here, and do so.
subscribe via RSS