#### Title

On tiling rectangles with rectangles

#### Date of Publication

2001

#### Document Type

Bachelor's Thesis

#### Degree Name

Bachelor of Science in Mathematics

#### College

College of Science

#### Department/Unit

Mathematics and Statistics Department

#### Abstract/Summary

The thesis is taken from the article Tiling Rectangles with Rectangles by F.R.K. Chung, E.N. Gilbert, R.L. Graham, J.B. Shearer and J.H. van Lint. This thesis concerns two main problem, namely, to determine the number of elements for which a simple rectangle tiling can be form, and the lower bound of the average area of the elements in any simple rectangle tiling with n number of elements.

A computer program illustrates the theorem which shows that for all n < 7, there exists a simple rectangle tiling with n elements.

For the second problem, it is shown that the average area of the elements in a simple tiling is strictly greater than 11/6. Moreover, there is only one simple rectangle tiling of the plane up to rotations, reflections and translations.

#### Abstract Format

html

#### Language

English

#### Format

#### Accession Number

TU10721

#### Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

#### Physical Description

77 numb. leaves

#### Recommended Citation

Chua, K., & Mijares, J. (2001). On tiling rectangles with rectangles. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/17159