  The zero-error capacity of channels with a countably infinite input alphabet
formally generalises Shannon's classical problem about the capacity of discrete
memoryless channels. We solve the problem for three particular channels. Our
results are purely combinatorial and in line with previous work of the third
author about permutation capacity.
