Uniform Sampling of Fixed Size Polyominoes
摘要
Polyominoes are discrete geometric objects formed with a set of connected squared cells. They were introduced by Golomb in 1954 and raise difficult combinatorial questions such as counting them. In this paper, we establish an upper bound for the convergence speed of a method introduced by Stauffer for generating uniformly polyominoes of a given size.