{"id":{"repo_id":"mississippi","oai_identifier":"oai:egrove.olemiss.edu:etd-2325"},"canonical_url":"https://search.dev.ndltd.org/etd/mississippi/oai:egrove.olemiss.edu:etd-2325","repository":{"repo_id":"mississippi","name":"University of Mississippi","base_url":"https://egrove.olemiss.edu/do/oai/"},"display":{"title":"(Visible) Tilings of Squares and Hypercubes","abstract":"More than eighty years ago, Erdos considered sums of the side lengths of squares packed into a unit square.Here we consider various classes of tilings , this is, packings where there is no empty space inside the unit square. Several types of questions will be explored here. Various construction techniques are introduced, especially methods of generating tilings from tilings with fewer tiles. For some small values of n, I determine all tilings of the unit square with n tiles. I have found a best possible upper bound for a visible tiling, that is a tiling which every tile shares a face with the unit square. Furthermore, I generalize this result to higher dimensions for visible tilings.","abstract_html":"More than eighty years ago, Erdos considered sums of the side lengths of squares packed into a unit square.Here we consider various classes of tilings , this is, packings where there is no empty space inside the unit square. Several types of questions will be explored here. Various construction techniques are introduced, especially methods of generating tilings from tilings with fewer tiles. For some small values of n, I determine all tilings of the unit square with n tiles. I have found a best possible upper bound for a visible tiling, that is a tiling which every tile shares a face with the unit square. Furthermore, I generalize this result to higher dimensions for visible tilings.","abstract_has_math":false,"creators":["Burt, John Randall"],"institution":null,"degree_name":"M.S. in Mathematics","degree_level":"Thesis","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["William Staton","Talmadge James Reid","Bing Wei"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-01-01T08:00:00Z","date_published":"2014-01-01T08:00:00Z","updated_at":"2026-07-24T03:06:44Z","subjects":["Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://egrove.olemiss.edu/etd/1326","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["William Staton","Talmadge James Reid","Bing Wei"]},{"key":"dc:creator","label":"Author","values":["Burt, John Randall"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2020-01-23T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S. in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://egrove.olemiss.edu/etd/1326"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["More than eighty years ago, Erdos considered sums of the side lengths of squares packed into a unit square.Here we consider various classes of tilings , this is, packings where there is no empty space inside the unit square. Several types of questions will be explored here. Various construction techniques are introduced, especially methods of generating tilings from tilings with fewer tiles. For some small values of n, I determine all tilings of the unit square with n tiles. I have found a best possible upper bound for a visible tiling, that is a tiling which every tile shares a face with the unit square. Furthermore, I generalize this result to higher dimensions for visible tilings."]},{"key":"dc:title","label":"Title","values":["(Visible) Tilings of Squares and Hypercubes"]}]}],"canonical_facts":{"dc:contributor":["William Staton","Talmadge James Reid","Bing Wei"],"dc:creator":["Burt, John Randall"],"dc:date.available":["2020-01-23T08:00:00Z"],"dc:description.abstract":["More than eighty years ago, Erdos considered sums of the side lengths of squares packed into a unit square.Here we consider various classes of tilings , this is, packings where there is no empty space inside the unit square. Several types of questions will be explored here. Various construction techniques are introduced, especially methods of generating tilings from tilings with fewer tiles. For some small values of n, I determine all tilings of the unit square with n tiles. I have found a best possible upper bound for a visible tiling, that is a tiling which every tile shares a face with the unit square. Furthermore, I generalize this result to higher dimensions for visible tilings."],"dc:identifier":["https://egrove.olemiss.edu/etd/1326"],"dc:subject":["Mathematics"],"dc:title":["(Visible) Tilings of Squares and Hypercubes"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S. in Mathematics"]},"updated_at":"2026-07-24T03:06:44Z"}