Double Tiles

Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular hexagons. We focus on the special case of the double tile prob...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Beluhov, Nikolai
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Beluhov, Nikolai
description Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular hexagons. We focus on the special case of the double tile problem where both tilings are in the square class. For this special case, we give an explicit description of all double tiles. We establish the result for polyominoes first; then, with little additional effort, we extend the proof to general polygons. Central to the description is a certain finite set of transformations which we apply iteratively to a base shape in order to obtain one family of "fractal-like" polyominoes. The double tiles are then given by these polyominoes together with particular "deformations" of them.
doi_str_mv 10.48550/arxiv.2412.08989
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2412_08989</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2412_08989</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2412_089893</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjE00jOwsLSw5GTgcckvTcpJVQjJzEkt5mFgTUvMKU7lhdLcDPJuriHOHrpgffEFRZm5iUWV8SD98WD9xoRVAABNsyM9</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Double Tiles</title><source>arXiv.org</source><creator>Beluhov, Nikolai</creator><creatorcontrib>Beluhov, Nikolai</creatorcontrib><description>Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular hexagons. We focus on the special case of the double tile problem where both tilings are in the square class. For this special case, we give an explicit description of all double tiles. We establish the result for polyominoes first; then, with little additional effort, we extend the proof to general polygons. Central to the description is a certain finite set of transformations which we apply iteratively to a base shape in order to obtain one family of "fractal-like" polyominoes. The double tiles are then given by these polyominoes together with particular "deformations" of them.</description><identifier>DOI: 10.48550/arxiv.2412.08989</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2024-12</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,778,883</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2412.08989$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2412.08989$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Beluhov, Nikolai</creatorcontrib><title>Double Tiles</title><description>Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular hexagons. We focus on the special case of the double tile problem where both tilings are in the square class. For this special case, we give an explicit description of all double tiles. We establish the result for polyominoes first; then, with little additional effort, we extend the proof to general polygons. Central to the description is a certain finite set of transformations which we apply iteratively to a base shape in order to obtain one family of "fractal-like" polyominoes. The double tiles are then given by these polyominoes together with particular "deformations" of them.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjE00jOwsLSw5GTgcckvTcpJVQjJzEkt5mFgTUvMKU7lhdLcDPJuriHOHrpgffEFRZm5iUWV8SD98WD9xoRVAABNsyM9</recordid><startdate>20241212</startdate><enddate>20241212</enddate><creator>Beluhov, Nikolai</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20241212</creationdate><title>Double Tiles</title><author>Beluhov, Nikolai</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2412_089893</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Beluhov, Nikolai</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Beluhov, Nikolai</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Double Tiles</atitle><date>2024-12-12</date><risdate>2024</risdate><abstract>Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular hexagons. We focus on the special case of the double tile problem where both tilings are in the square class. For this special case, we give an explicit description of all double tiles. We establish the result for polyominoes first; then, with little additional effort, we extend the proof to general polygons. Central to the description is a certain finite set of transformations which we apply iteratively to a base shape in order to obtain one family of "fractal-like" polyominoes. The double tiles are then given by these polyominoes together with particular "deformations" of them.</abstract><doi>10.48550/arxiv.2412.08989</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2412.08989
ispartof
issn
language eng
recordid cdi_arxiv_primary_2412_08989
source arXiv.org
subjects Mathematics - Combinatorics
title Double Tiles
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T14%3A02%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Double%20Tiles&rft.au=Beluhov,%20Nikolai&rft.date=2024-12-12&rft_id=info:doi/10.48550/arxiv.2412.08989&rft_dat=%3Carxiv_GOX%3E2412_08989%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true