{"id":188,"date":"2018-03-21T20:11:17","date_gmt":"2018-03-21T20:11:17","guid":{"rendered":"https:\/\/asarg.hackresearch.com\/main\/?p=188"},"modified":"2018-03-21T20:11:17","modified_gmt":"2018-03-21T20:11:17","slug":"optimal-staged-self-assembly-of-linear-assemblies","status":"publish","type":"post","link":"https:\/\/asarg.hackresearch.com\/main\/2018\/03\/21\/optimal-staged-self-assembly-of-linear-assemblies\/","title":{"rendered":"Optimal Staged Self-Assembly of Linear Assemblies"},"content":{"rendered":"<p>Title: Optimal Staged Self-Assembly of Linear Assemblies<br \/>\nAuthors: Cameron Chalk, Eric Martinez, Robert Schweller, Luis Vega, Andrew Winslow, Tim Wylie<br \/>\nAbstract:<br \/>\nWe analyze the complexity of building linear assemblies, sets of linear assemblies, and $\\mathcal{O}(1)$-scale general shapes in the staged tile assembly model. For systems with at most $b$ bins and $t$ tile types, we prove that the minimum number of stages to uniquely assemble a $1 \\times n$ \\emph{line} is $\\Theta(\\log_t{n} + \\log_b{\\frac{n}{t}} + 1)$. Generalizing to $\\BO{1} \\times n$ lines, we prove the minimum number of stages is $\\BO{\\frac{\\log{n} &#8211; tb &#8211; t\\log t}{b^2} + \\frac{\\log \\log b}{\\log t}}$ and $\\Omega(\\frac{\\log{n} &#8211; tb &#8211; t\\log t}{b^2})$. We also obtain similar upper and lower bounds in a model permitting \\emph{flexible glues} using non-diagonal glue functions.<\/p>\n<p>Next, we consider assembling sets of lines and general shapes using $t = \\BO{1}$ tile types. We prove that the minimum number of stages needed to assemble a set of $k$ lines of size at most $\\BO{1} \\times n$ is $\\BO{\\frac{k\\log n}{b^2}+\\frac{k\\sqrt{\\log n}}{b}+\\log\\log n}$ and $\\Omega(\\frac{k\\log n}{b^2})$. In the case that $b = \\BO{\\sqrt{k}}$, the minimum number of stages is $\\Theta(\\log{n})$. The upper bound in this special case is then used to assemble &#8220;hefty&#8221; shapes of at least logarithmic edge-length-to-edge-count ratio at $\\BO{1}$-scale using $\\BO{\\sqrt{k}}$ bins and optimal $\\BO{\\log{n}}$ stages.<\/p>\n<p>Citation: Proc. of 17th Inter. Conf. on Unconventional Computation and Natural Computation (UCNC&#8217;18)<br \/>\nBibtex:<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Title: Optimal Staged Self-Assembly of Linear Assemblies Authors: Cameron Chalk, Eric Martinez, Robert Schweller, Luis Vega, Andrew Winslow, Tim Wylie Abstract: We analyze the complexity of building linear assemblies, sets of linear assemblies, and $\\mathcal{O}(1)$-scale general shapes in the staged tile assembly model. For systems with at most $b$ bins and $t$ tile types, we &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/asarg.hackresearch.com\/main\/2018\/03\/21\/optimal-staged-self-assembly-of-linear-assemblies\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Optimal Staged Self-Assembly of Linear Assemblies&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[4],"tags":[21,13,16],"_links":{"self":[{"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/posts\/188"}],"collection":[{"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/comments?post=188"}],"version-history":[{"count":1,"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/posts\/188\/revisions"}],"predecessor-version":[{"id":189,"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/posts\/188\/revisions\/189"}],"wp:attachment":[{"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/media?parent=188"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/categories?post=188"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/asarg.hackresearch.com\/main\/wp-json\/wp\/v2\/tags?post=188"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}