Low-Complexity Tilings of the Plane
| dc.contributor.author | Jarkko Kari | |
| dc.contributor.organization | fi=matematiikka|en=Mathematics| | |
| dc.contributor.organization-code | 1.2.246.10.2458963.20.41687507875 | |
| dc.converis.publication-id | 41851167 | |
| dc.converis.url | https://research.utu.fi/converis/portal/Publication/41851167 | |
| dc.date.accessioned | 2022-10-27T12:24:26Z | |
| dc.date.available | 2022-10-27T12:24:26Z | |
| dc.description.abstract | <p>A two-dimensional configuration is a coloring of the infinite grid Z2 with finitely many colors. For a finite subset D of Z2, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The number of distinct D-patterns of a configuration is a natural measure of its complexity. A configuration is considered having low complexity with respect to shape D if the number of distinct D-patterns is at most |D|, the size of the shape. This extended abstract is a short review of an algebraic method to study periodicity of such low complexity configurations.<br /></p> | |
| dc.format.pagerange | 35 | |
| dc.format.pagerange | 45 | |
| dc.identifier.eisbn | 978-3-030-23247-4 | |
| dc.identifier.isbn | 978-3-030-23246-7 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.jour-issn | 0302-9743 | |
| dc.identifier.olddbid | 175295 | |
| dc.identifier.oldhandle | 10024/158389 | |
| dc.identifier.uri | https://www.utupub.fi/handle/11111/35890 | |
| dc.identifier.urn | URN:NBN:fi-fe2021042823599 | |
| dc.language.iso | en | |
| dc.okm.affiliatedauthor | Kari, Jarkko | |
| dc.okm.discipline | 111 Mathematics | en_GB |
| dc.okm.discipline | 111 Matematiikka | fi_FI |
| dc.okm.internationalcopublication | not an international co-publication | |
| dc.okm.internationality | International publication | |
| dc.okm.type | A4 Conference Article | |
| dc.publisher.country | Switzerland | en_GB |
| dc.publisher.country | Sveitsi | fi_FI |
| dc.publisher.country-code | CH | |
| dc.relation.conference | International Conference on Descriptional Complexity of Formal Systems | |
| dc.relation.doi | 10.1007/978-3-030-23247-4_2 | |
| dc.relation.ispartofjournal | Lecture Notes in Computer Science | |
| dc.relation.volume | 11612 | |
| dc.source.identifier | https://www.utupub.fi/handle/10024/158389 | |
| dc.title | Low-Complexity Tilings of the Plane | |
| dc.title.book | Descriptional Complexity of Formal Systems: 21st IFIP WG 1.02 International Conference, DCFS 2019 Košice, Slovakia, July 17–19, 2019 | |
| dc.year.issued | 2019 |
Tiedostot
1 - 1 / 1
Ladataan...
- Name:
- dcfsarXiv.pdf
- Size:
- 98.05 KB
- Format:
- Adobe Portable Document Format
- Description:
- Final draft