Algorithmic design of self-assembling structures
Name
Cohn-2009-Algorithmic design o.pdf
Size
1008.08 KB
Format
Adobe PDF
Checksum (MD5)
d90823c2d25bbb51421c9091528a2777
Author(s)
Kumar, Abhinav
Cohn, Henry
Date Issued
April 2009
Journal
Proceedings of the National Academy of Sciences of the United States of America
Publisher
United States National Academy of Sciences
Citation
Cohn, Henry, and Abhinav Kumar. “Algorithmic design of self-assembling structures.” Proceedings of the National Academy of Sciences 106.24 (2009): 9570-9575. © 2009 National Academy of Sciences
Version
Final published version
Abstract
We study inverse statistical mechanics: how can one design a potential function so as to produce a specified ground state? In this article, we show that unexpectedly simple potential functions suffice for certain symmetrical configurations, and we apply techniques from coding and information theory to provide mathematical proof that the ground state has been achieved. These potential functions are required to be decreasing and convex, which rules out the use of potential wells. Furthermore, we give an algorithm for constructing a potential function with a desired ground state.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1073/pnas.0901636106
