Related papers: More Tight Bounds for Active Self-Assembly Using a…
The Strong Exponential Time Hypothesis (SETH) asserts that for every $\varepsilon>0$ there exists $k$ such that $k$-SAT requires time $(2-\varepsilon)^n$. The field of fine-grained complexity has leveraged SETH to prove quite tight…
Soft composite solids are made of inclusions dispersed within soft matrices. They are ubiquitous in nature and form the basis of many biological tissues. In the field of materials science, synthetic soft composites are promising candidates…
In this paper we obtain the central limit theorems, moderate deviations and the laws of the iterated logarithm for the energy \[H_n=\sum_{1\le j<k\le n}\omega_j\omega_k1_{\{S_j=S_k\}}\] of the polymer $\{S_1,...,S_n\}$ equipped with random…
An important goal of self-assembly is to achieve a preprogrammed structure with high fidelity. Here, we control the valence of DNA-functionalized emulsions to make linear and branched model polymers, or `colloidomers'. The distribution of…
Deep learning models are gaining popularity and potency in predicting polymer properties. These models can be built using pre-existing data and are useful for the rapid prediction of polymer properties. However, the performance of a deep…
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…
We show that the compressed suffix array and the compressed suffix tree of a string $T$ can be built in $O(n)$ deterministic time using $O(n\log\sigma)$ bits of space, where $n$ is the string length and $\sigma$ is the alphabet size.…
Recently it has been shown that a two-dimensional model of self-attracting polymers based on attracting segments displays two phase transitions, a theta-like collapse between swollen polymers and a globular state and another between the…
Linear upper bounds may be derived by imposing specific structural conditions on a generating set, such as additional constraints on ranks, eigenvalues, or the degree of the minimal polynomial of the generating matrices. This paper…
Through extensive Monte Carlo simulations, we systematically study the effect of chain stiffness on the packing ability of linear polymers composed of hard spheres in extremely confined monolayers, corresponding effectively to 2D films.…
Polymers consisting of more than one type of monomer, known as copolymers, are vital to both living and synthetic systems. Copolymerisation has been studied theoretically in a number of contexts, often by considering a Markov process in…
Polymer rings in solution are either permanently entangled or not. Permanent topological restrictions give rise to additional entropic interactions apart from the ones arising due to mere chain flexibility or excluded volume. Conversely,…
Protein folds are highly designable, in the sense that many sequences fold to the same conformation. In the present work we derive an expression for the designability in a 20 letter lattice model of proteins which, relying only on the…
Controlling the size and shape of assembled structures is a fundamental challenge in self-assembly, and is highly relevant in material design and biology. Here, we show that specific, but promiscuous, short-range binding interactions make…
Bin Packing with $k$ bins is a fundamental optimisation problem in which we are given a set of $n$ integers and a capacity $T$ and the goal is to partition the set into $k$ subsets, each of total sum at most $T$. Bin Packing is NP-hard…
Polymers with active segments constitute prospective future materials and are used as a model for some biological systems such as chromatin. The directions of the active forces are typically introduced with temporal or spatial correlations…
We propose a solution strategy for a multimaterial minimum compliance topology optimization problem, which consists in finding the optimal allocation of a finite number of candidate (possibly anisotropic) materials inside a reference…
We describe methods for proving upper and lower bounds on infinite-time averages in deterministic dynamical systems and on stationary expectations in stochastic systems. The dynamics and the quantities to be bounded are assumed to be…
The connection between self-assembly and computation suggests that a shape can be considered the output of a self-assembly ``program,'' a set of tiles that fit together to create a shape. It seems plausible that the size of the smallest…
A fully self-contained model of homochirality is presented that contains the effects of both polymerization and dissociation. The dissociation fragments are assumed to replenish the substrate from which new monomers can grow and undergo new…