Related papers: Improved lower and upper bounds on the tile comple…
It is demonstrated that any almost-tilting module over a gentle algebra is indeed partial-tilting, meaning it can be completed as a tilting module. Furthermore, such a module has at most $2n$ possible complements, thereby confirming a…
Quantum dot (QD) lay-outs are becoming more complex as the technology is being applied to more complex multi-QD structures. This increase in complexity requires improved capacitance modeling both for design and accurate interpretation of QD…
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…
We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only…
The threshold-$k$ metric dimension ($\mathrm{Tmd}_k$) of a graph is the minimum number of sensors -- a subset of the vertex set -- needed to uniquely identify any vertex in the graph, solely based on its distances from the sensors, when the…
We present fast simulation methods for the self-assembly of complex shapes in two dimensions. The shapes are modeled via a general boundary curve and interact via a standard volume term promoting overlap and an interpenetration penalty. To…
In geometrically frustrated assemblies, equilibrium self-limitation manifests in the form of a minimum in the free energy per subunit at a finite, multi-subunit size which results from the competition between the elastic costs of…
A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We…
This paper introduces a new approach for the automated reconstruction - reassembly of fragmented objects having one surface near to plane, on the basis of the 3D representation of their constituent fragments. The whole process starts by 3D…
We derive upper and lower bounds on the fidelity susceptibility in terms of macroscopic thermodynamical quantities, like susceptibilities and thermal average values. The quality of the bounds is checked by the exact expressions for a single…
The dynamic and static properties of a supercooled (non-entangled) polymer melt are investigated via molecular dynamics (MD) simulations. The system is confined between two completely smooth and purely repulsive walls. The wall-to-wall…
The cornerstone of structural biology is the unique relationship between protein sequence and the 3D structure at equilibrium. Although intrinsically disordered proteins (IDPs) do not fold into a specific 3D structure, breaking this…
We consider non cooperative binding in so called `temperature 1', in deterministic (here called {\it confluent}) tile self-assembly systems (1-TAS) and prove the standing conjecture that such systems do not have universal computational…
In this paper we present a mixed projection- and density-based topology optimization approach. The aim is to combine the benefits of both parametrizations: the explicit geometric representation provides specific controls on certain design…
Sphere packings in high dimensions interest mathematicians and physicists and have direct applications in communications theory. Remarkably, no one has been able to provide exponential improvement on a 100-year-old lower bound on the…
The impact of confinement on self-assembly of particles interacting with short-range attraction and long-range repulsion (SALR) potential is studied for thermodynamic states corresponding to local ordering of clusters or layers in the bulk.…
By means of sophisticated Monte Carlo methods, we investigate the conformational phase diagram of a simple model for flexible polymers with explicit thickness. The thickness constraint, which is introduced geometrically via the global…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
In the framework of virtual element discretizazions, we address the problem of imposing non homogeneous Dirichlet boundary conditions in a weak form, both on polygonal/polyhedral domains and on two/three dimensional domains with curved…
We present a novel experimental setup to investigate two-dimensional thermal convection in a freestanding thin liquid film. We develop a setup for the reproducible generation of freestanding thin liquid films. Such films can be produced in…