Related papers: Improved lower and upper bounds on the tile comple…
Very thin elastic sheets, even at zero temperature, exhibit nonlinear elastic response by virtue of their dominant bending modes. Their behavior is even richer at finite temperature. Here we use molecular dynamics (MD) to study the…
We present a series of results related to mathematical models of self-assembling tiles and the impacts that three diverse properties have on their dynamics. We expand upon a series of prior results which showed that (1) the abstract Tile…
Building structures with hierarchical order through the self-assembly of smaller blocks is not only a prerogative of nature, but also a strategy to design artificial materials with tailored functions. We explore in simulation the…
The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory and machine learning. In fact, the algorithms form a…
We consider the thermal softening of crystals due to anharmonicity. Self-consistent methods find a maximum temperature for a stable crystal, which gives an upper bound to the melting temperature. Previous workers have shown that the…
We study infinite dimensional tilting modules over a concealed canonical algebra of domestic or tubular type. In the domestic case, such tilting modules are constructed by using the technique of universal localization, and they can be…
Although the physical properties of the 2D and 1D Ising models are quite different, we point out an interesting connection between their complex-temperature phase diagrams. We carry out an exact determination of the complex-temperature…
The self-assembly of hard polyhedral particles confined to a flat interface is studied using Monte Carlo simulations. The particles are pinned to the interface by restricting their movement in the direction perpendicular to it while…
We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…
We study the query complexity of geodesically convex (g-convex) optimization on a manifold. To isolate the effect of that manifold's curvature, we primarily focus on hyperbolic spaces. In a variety of settings (smooth or not; strongly…
Decision Diagrams (DDs) have emerged as a powerful tool for discrete optimization, with rapidly growing adoption. DDs are directed acyclic layered graphs; restricted DDs are a generalized greedy heuristic for finding feasible solutions, and…
Direct Multisearch is a well-established class of algorithms, suited for multiobjective derivative-free optimization. In this work, we analyze the worst-case complexity of this class of methods in its most general formulation for…
Nonconvex and nonsmooth optimization problems are frequently encountered in much of statistics, business, science and engineering, but they are not yet widely recognized as a technology in the sense of scalability. A reason for this…
We study the complexity of fundamental distributed graph problems in the recently popular setting where information about the input graph is available to the nodes before the start of the computation. We focus on the most common such…
We prove two tight bounds 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 consider unsupervised learning methods for characterizing the disordered microscopic structure of supercooled liquids and glasses. Specifically, we perform dimensionality reduction of smooth structural descriptors that describe radial…
In this paper, we study the 3D strip packing problem in which we are given a list of 3-dimensional boxes and required to pack all of them into a 3-dimensional strip with length 1 and width 1 and unlimited height to minimize the height used.…
We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…
3D integration technologies are seeing widespread adoption in the semiconductor industry to offset the limitations and slowdown of two-dimensional scaling. High-density 3D integration techniques such as face-to-face wafer bonding with…
Klee's measure problem (computing the volume of the union of $n$ axis-parallel boxes in $\mathbb{R}^d$) is well known to have $n^{\frac{d}{2}\pm o(1)}$-time algorithms (Overmars, Yap, SICOMP'91; Chan FOCS'13). Only recently, a conditional…