Name
Abstract | ||
|---|---|---|
A "dyadic rectangle" is a set of the form R = [a2-s,(a + 1)2-s] × [b2-t,(b + 1)2-t], where s and t are nonnegative integers. A dyadic tiling is a tiling of the unit square with dyadic rectangles. In this paper we study n-tilings, which consist of 2n nonoverlapping dyadic rectangles, each of area 2-n, whose union is the unit square. We discuss some of the underlying combinatorial structures, provide some efficient methods for uniformly sampling from the set of n-tilings, and study some limiting properties of random tilings. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1002/rsa.10051 | Random Struct. Algorithms |
Keywords | Field | DocType |
random tilings,dyadic rectangle,dyadic tiling,underlying combinatorial structure,efficient method,unit square,area 2-n,random dyadic tilings,nonnegative integer,form r | Discrete mathematics,Combinatorics,Rhombille tiling,Square tiling,Substitution tiling,Trihexagonal tiling,Hexagonal tiling,Rectangle,Triangular tiling,Unit square,Mathematics | Journal |
Volume | Issue | ISSN |
21 | 3-4 | 1042-9832 |
Citations | PageRank | References |
2 | 0.40 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Svante Janson | 1 | 1009 | 149.67 |
| Dana Randall | 2 | 29 | 8.15 |
| Joel Spencer | 3 | 41 | 4.73 |