๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Signed Tilings with Squares

โœ Scribed by Kevin Keating; Jonathan King

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
232 KB
Volume
85
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

โœฆ Synopsis

Let T be a bounded region in the Cartesian plane built from finitely many rectangles of the form [a 1 , a 2 )_[b 1 , b 2 ), with a 1 <a 2 and b 1 <b 2 . We give a necessary and sufficient condition for T to be tilable with finitely many positive and negative squares.

๐Ÿ“œ SIMILAR VOLUMES

Tiling a Square with Eight Congruent Pol
Tiling a Square with Eight Congruent Polyominoes
โœ Michael Reid ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 76 KB

The problem of finding polyominoes that tile rectangles has attracted a lot of attention; see [1] for an overview, and [2, 3] for more recent results. Several general families of such polyominoes are known, but sporadic examples seem to be scarce. Marshall [2, Fig. 9] gives a polyomino of rectangula

Tiling a Rectangle with the Fewest Squar
Tiling a Rectangle with the Fewest Squares
โœ Richard Kenyon ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 594 KB

We show that a square-tiling of a p\_q rectangle, where p and q are relatively prime integers, has at least log 2 p squares. If q>p we construct a square-tiling with less than qร‚p+C log p squares of integer size, for some universal constant C.

Ribbon Tile Invariants from the Signed A
Ribbon Tile Invariants from the Signed Area
โœ Cristopher Moore; Igor Pak ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 154 KB

Ribbon tiles are polyominoes consisting of n squares laid out in a path, each step of which goes north or east. Tile invariants were first introduced by the second author (2000, Trans. Amer. Math. Soc. 352, 5525-5561), where a full basis of invariants of ribbon tiles was conjectured. Here we present

Signs on Latin Squares
Signs on Latin Squares
โœ A. Marini; G. Pirillo ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 508 KB
Entropy of the random triangle-square ti
Entropy of the random triangle-square tiling
โœ Hikaru Kawamura ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 267 KB

The random triangle-square tiling with twelvefold quasicrystalline order is studied by using the transfer-matrix method. Based on a systematic finite-size analysis for L ร— oo lattices up to L = 9, the maximum entropy per vertex for an infinite system is estimated to be S= 0.119 \_+ 0.00 I. The ratio