A grid region is (roughly speaking) a collection of “elementary cells” (squares, for example, or triangles) in the plane. One can “tile” these grid regions by arranging the cells in pairs. In this snapshot we review different strategies to generate random tilings of large grid regions in the plane. This makes it possible to observe the behaviour of large random tilings, in particular the occurrence of boundary phenomena that have been the subject of intensive recent research
23 pagesInternational audienceThis article presents uniform random generators of plane partitions ac...
The paper concerns lattice triangulations, that is, triangulations of the in- teger points in a poly...
Abstract. A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m = ...
AbstractThe problem of counting tilings of a plane region using specified tiles can often be recast ...
Consider the following Markov chain, whose states are all domino tilings of a 2n \Theta 2n chessboar...
42 pages, 9 figuresInternational audienceThe prototypical problem we study here is the following. Gi...
In this thesis we study two types of tilings : tilings by a pair of squares and tilings on the tri-h...
Dans cette thèse nous étudions deux types de pavages : des pavages par une paire de carres et des pa...
We give a new proof of the fact that, near a turning point of the frozen boundary, the vertical tile...
We consider tilings of quadriculated regions by dominoes and oftriangulated regions by lozenges. We ...
The arctic circle theorem of Jockusch, Propp, and Shor asserts that uniformly random domino tilings ...
this paper. 3 Figure 5. Random tiling of square of side 80 vertical, white square on the top vertic...
AbstractWe first prove that the set of domino tilings of a fixed finite figure is a distributive lat...
Random triangulated surfaces are created by taking an even number, n, of triangles and arbitrarily ”...
Figures 1 and 2.(a) actually show a transformation of a tiling into another tiling of the same surfa...
23 pagesInternational audienceThis article presents uniform random generators of plane partitions ac...
The paper concerns lattice triangulations, that is, triangulations of the in- teger points in a poly...
Abstract. A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m = ...
AbstractThe problem of counting tilings of a plane region using specified tiles can often be recast ...
Consider the following Markov chain, whose states are all domino tilings of a 2n \Theta 2n chessboar...
42 pages, 9 figuresInternational audienceThe prototypical problem we study here is the following. Gi...
In this thesis we study two types of tilings : tilings by a pair of squares and tilings on the tri-h...
Dans cette thèse nous étudions deux types de pavages : des pavages par une paire de carres et des pa...
We give a new proof of the fact that, near a turning point of the frozen boundary, the vertical tile...
We consider tilings of quadriculated regions by dominoes and oftriangulated regions by lozenges. We ...
The arctic circle theorem of Jockusch, Propp, and Shor asserts that uniformly random domino tilings ...
this paper. 3 Figure 5. Random tiling of square of side 80 vertical, white square on the top vertic...
AbstractWe first prove that the set of domino tilings of a fixed finite figure is a distributive lat...
Random triangulated surfaces are created by taking an even number, n, of triangles and arbitrarily ”...
Figures 1 and 2.(a) actually show a transformation of a tiling into another tiling of the same surfa...
23 pagesInternational audienceThis article presents uniform random generators of plane partitions ac...
The paper concerns lattice triangulations, that is, triangulations of the in- teger points in a poly...
Abstract. A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m = ...