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

A Note on Tiling with Integer-Sided Rectangles

โœ Scribed by Richard Kenyon

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
350 KB
Volume
74
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

โœฆ Synopsis

We show how to determine if a given rectilinear polygon can be tiled with rectangles, each having an integer side.

๐Ÿ“œ SIMILAR VOLUMES

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.

Tiling the Integers with Translates of O
Tiling the Integers with Translates of One Finite Set
โœ Ethan M. Coven; Aaron Meyerowitz ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 115 KB

A set tiles the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For sets of prime power ลฝ . size, it was solved by D. Newman 1977, J. Numbe

A note on algebraic integers
A note on algebraic integers
โœ P.E. Blanksby ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 204 KB
A Note on the Asymptotic Number of Latin
A Note on the Asymptotic Number of Latin Rectangles
โœ I. Skau ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 75 KB

The enumeration problem of Latin rectangles is formulated in terms of permanents, and two 'hard' inequalities of permanents are applied in a squeezing manner, both giving and suggesting asymptotic formulas.