<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-25T01:47:04Z</responseDate>
  <request identifier="1334" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1334</identifier>
        <datestamp>2024-03-06T10:32:56Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Structural aspects of tilings</dc:title>
          <dc:creator>Ballier, Alexis</dc:creator>
          <dc:creator>Durand, Bruno</dc:creator>
          <dc:creator>Jeandal, Emmanuel</dc:creator>
          <dc:subject>Tiling</dc:subject>
          <dc:subject>domino</dc:subject>
          <dc:subject>patterns</dc:subject>
          <dc:subject>tiling preorder</dc:subject>
          <dc:subject>tiling structure</dc:subject>
          <dc:description>In this paper, we study the structure of the set of tilings&#13;
    produced by any given tile-set.  For better understanding this&#13;
    structure, we address the set of finite patterns that each tiling&#13;
    contains.&#13;
&#13;
    This set of patterns can be analyzed in two different contexts:&#13;
    the first one is combinatorial and the other topological.  These&#13;
    two approaches have independent merits and, once combined, provide&#13;
    somehow surprising results.&#13;
&#13;
    The particular case where the set of produced tilings is countable&#13;
    is deeply investigated while we prove that the uncountable case&#13;
    may have a completely different structure.&#13;
&#13;
    We introduce a pattern preorder and also make use of&#13;
    Cantor-Bendixson rank.  Our first main result is that a tile-set&#13;
    that produces only periodic tilings produces only a finite number&#13;
    of them.  Our second main result exhibits a tiling with exactly&#13;
    one vector of periodicity in the countable case.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Alexis Ballier and Bruno Durand and Emmanuel Jeandal</dc:contributor>
          <dc:date>2008</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.STACS.2008.1334</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-13343</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1334</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
