arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.5985cs.CGcs.CCcs.ET
收藏

关于瓷砖的思考(自组装)

Reflections on Tiles (in Self-Assembly)

Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers

摘要:

我们定义的自反瓷砖组装模型(RTAM),这是从抽象瓷砖组装模型(aTAM),通过允许瓷砖,以反映其水平和/或垂直轴。我们表明,类的有向温度-1 RTAM系统是不计算通用的,这是证明,但未证明的aTAM,和aTAM一样,RTAM是计算通用的温度2。然后,我们表明,在温度1,当从一个单一的瓷砖种子,RTAM是能够组装n × n平方为n奇数只使用n瓷砖类型,但不能组装n × n平方为n偶数。此外,我们表明,n是一个下界的瓷砖类型的数量需要组装n × n平方为n奇数的温度-1 RTAM。温度为1的aTAM系统的稳定下界为2n-1。最后,我们给出了Z^2中哪些有限连通形状可以被单种子(即种子大小为1)RTAM系统组装(严格或弱)的分类的初步结果,包括哪些有限连通形状可以被“无失配”单种子RTAM系统严格组装的完整分类。

英文摘要:

We define the Reflexive Tile Assembly Model (RTAM), which is obtained from the abstract Tile Assembly Model (aTAM) by allowing tiles to reflect across their horizontal and/or vertical axes. We show that the class of directed temperature-1 RTAM systems is not computationally universal, which is conjectured but unproven for the aTAM, and like the aTAM, the RTAM is computationally universal at temperature 2. We then show that at temperature 1, when starting from a single tile seed, the RTAM is capable of assembling n x n squares for n odd using only n tile types, but incapable of assembling n x n squares for n even. Moreover, we show that n is a lower bound on the number of tile types needed to assemble n x n squares for n odd in the temperature-1 RTAM. The conjectured lower bound for temperature-1 aTAM systems is 2n-1. Finally, we give preliminary results toward the classification of which finite connected shapes in Z^2 can be assembled (strictly or weakly) by a singly seeded (i.e. seed of size 1) RTAM system, including a complete classification of which finite connected shapes be strictly assembled by a "mismatch-free" singly seeded RTAM system.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑