Self-Assembly of Patterns in the abstract Tile Assembly Model
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914708805648384 |
|---|---|
| author | Drake, Phillip Patitz, Matthew J. Summers, Scott M. Tracy, Tyler |
| author_facet | Drake, Phillip Patitz, Matthew J. Summers, Scott M. Tracy, Tyler |
| contents | In the abstract Tile Assembly Model, self-assembling systems consisting of tiles of different colors can form structures on which colored patterns are ``painted.'' We explore the complexity, in terms of the numbers of unique tile types required, of assembling various patterns. We first demonstrate how to efficiently self-assemble a set of simple patterns, then show tight bounds on the tile type complexity of self-assembling 2-colored patterns on the surfaces of square assemblies. Finally, we demonstrate an exponential gap in tile type complexity of self-assembling an infinite series of patterns between systems restricted to one plane versus those allowed two planes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_16284 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Self-Assembly of Patterns in the abstract Tile Assembly Model Drake, Phillip Patitz, Matthew J. Summers, Scott M. Tracy, Tyler Emerging Technologies Computational Complexity Computational Geometry In the abstract Tile Assembly Model, self-assembling systems consisting of tiles of different colors can form structures on which colored patterns are ``painted.'' We explore the complexity, in terms of the numbers of unique tile types required, of assembling various patterns. We first demonstrate how to efficiently self-assemble a set of simple patterns, then show tight bounds on the tile type complexity of self-assembling 2-colored patterns on the surfaces of square assemblies. Finally, we demonstrate an exponential gap in tile type complexity of self-assembling an infinite series of patterns between systems restricted to one plane versus those allowed two planes. |
| title | Self-Assembly of Patterns in the abstract Tile Assembly Model |
| topic | Emerging Technologies Computational Complexity Computational Geometry |
| url | https://arxiv.org/abs/2402.16284 |