arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1411.0973cs.DScs.ETcs.FL
收藏

基于插入基元的主动自组装的更紧边界

More Tight Bounds for Active Self-Assembly Using an Insertion Primitive

Benjamin Hescott, Caleb Malchik, Andrew Winslow

摘要:

我们证明了由达比和陈(SODA 2013)引入的自组装粒子模型的行为的几个限制,称为插入系统,其中单体将自己插入到不断增长的线性聚合物的中间。首先,我们证明了这些系统的表达能力等于上下文无关文法,回答了一个问题提出的达比和陈。其次,我们给出了严格的界限上的最大长度和最小预期时间的构造聚合物在系统中的三个日益严格的类。我们证明了$k$单体类型的系统可以在$O(\log^{5/3}(n))$期望的时间内确定性地构造长度为$n = 2^{Θ(k^{3/2})}$的聚合物。我们还证明,如果非确定性建设的有限数量的聚合物是允许的,那么预期的建设时间可以减少到$O(\log^{3/2}(n))$在权衡减少长度为$2^{Θ(k)}$。如果允许系统构造无限多个聚合物,则在$O(\log{n})$预期时间内构造无限长的聚合物是可能的。我们遵循这些积极的结果与一组下限证明,这些是最好的可能的聚合物长度和预期的建设时间。

英文摘要:

We prove several limits on the behavior of a model of self-assembling particles introduced by Dabby and Chen (SODA 2013), called insertion systems, where monomers insert themselves into the middle of a growing linear polymer. First, we prove that the expressive power of these systems is equal to context-free grammars, answering a question posed by Dabby and Chen. Second, we give tight bounds on the maximum length and minimum expected time of constructed polymers in systems of three increasingly restricted classes. We prove that systems of $k$ monomer types can deterministically construct polymers of length $n = 2^{Θ(k^{3/2})}$ in $O(\log^{5/3}(n))$ expected time. We also prove that if non-deterministic construction of a finite number of polymers is permitted, then the expected construction time can be reduced to $O(\log^{3/2}(n))$ at the trade-off of decreasing the length to $2^{Θ(k)}$. If the system is allowed to construct an infinite number of polymers, then constructing polymers of unbounded length in $O(\log{n})$ expected time is possible. We follow these positive results with a set of lower bounds proving that these are the best possible polymer lengths and expected construction times.

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

↑