Show simple item record

dc.contributor.authorChalk, Cameron
dc.contributor.authorMartinez, Eric
dc.contributor.authorSchweller, Robert
dc.contributor.authorVega, Luis
dc.contributor.authorWylie, Tim
dc.contributor.authorDemaine, Erik D
dc.contributor.authorDemaine, Martin L
dc.date.accessioned2018-04-23T18:56:41Z
dc.date.available2018-04-23T18:56:41Z
dc.date.issued2017-01
dc.identifier.isbn978-1-61197-478-2
dc.identifier.urihttp://hdl.handle.net/1721.1/114892
dc.description.abstractWe show how to design a universal shape replicator in a self- assembly system with both attractive and repulsive forces. More precisely, we show that there is a universal set of constant-size objects that, when added to any unknown holefree polyomino shape, produces an unbounded number of copies of that shape (plus constant-size garbage objects). The constant-size objects can be easily constructed from a constant number of individual tile types using a constant number of preprocessing self-assembly steps. Our construction uses the well-studied 2-Handed Assembly Model (2HAM) of tile self-assembly, in the simple model where glues interact only with identical glues, allowing glue strengths that are either positive (attractive) or negative (repulsive), and constant temperature (required glue strength for parts to hold together). We also require that the given shape has specified glue types on its surface, and that the feature size (smallest distance between nonincident edges) is bounded below by a constant. Shape replication necessarily requires a self-assembly model where parts can both attach and detach, and this construction is the first to do so using the natural model of negative/repulsive glues (also studied before for other problems such as fuel-efficient computation); previous replication constructions require more powerful global operations such as an “enzyme” that destroys a subset of the tile types.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant EFRI1240383)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-1138967)en_US
dc.language.isoen_US
dc.publisherSociety for Industrial and Applied Mathematicsen_US
dc.relation.isversionofhttp://dx.doi.org/10.1137/1.9781611974782.15en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT Web Domainen_US
dc.titleUniversal Shape Replicators via Self-Assembly with Attractive and Repulsive Forcesen_US
dc.typeArticleen_US
dc.identifier.citationChalk, Cameron, et al. "Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces." Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 16-19 January, 2017, Barcelona, Spain, Society for Industrial and Applied Mathematics, 2017, pp. 225–38.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorDemaine, Erik D
dc.contributor.mitauthorDemaine, Martin L
dc.relation.journalProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithmsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsChalk, Cameron; Demaine, Erik D.; Demaine, Martin L.; Martinez, Eric; Schweller, Robert; Vega, Luis; Wylie, Timen_US
dspace.embargo.termsNen_US
dc.identifier.orcidhttps://orcid.org/0000-0003-3803-5703
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record