![]() |
CiteULike | ![]() |
Scis0000002's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Algorithmic design of self-assembling structuresby: Henry Cohn, Abhinav Kumar
Proceedings of the National Academy of Sciences In Proceedings of the National Academy of Sciences, Vol. 106, No. 24. (16 June 2009), pp. 9570-9575.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
Abstract10.1073/pnas.0901636106 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.
BibTeX record
RIS record