English
Related papers

Related papers: Optimal Staged Self-Assembly of General Shapes

200 papers

The task of non-adaptive group testing is to identify up to $d$ defective items from $N$ items, where a test is positive if it contains at least one defective item, and negative otherwise. If there are $t$ tests, they can be represented as…

Information Theory · Computer Science 2020-01-07 Thach V. Bui , Minoru Kuribayashi , Tetsuya Kojima , Roghayyeh Haghvirdinezhad , Isao Echizen

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…

Computational Physics · Physics 2023-12-11 Lukas Mayrhofer , Myfanwy E. Evans , Gero Friesecke

Fully packed loop models on the square and the honeycomb lattice constitute new classes of critical behaviour, distinct from those of the low-temperature O(n) model. A simple symmetry argument suggests that such compact phases are only…

Statistical Mechanics · Physics 2009-10-31 Jesper Lykke Jacobsen

We use the shear construction to construct and classify a wide range of two-step solvable Lie groups admitting a left-invariant SKT structure. We reduce this to a specification of SKT shear data on Abelian Lie algebras, and which then is…

Differential Geometry · Mathematics 2020-11-10 Marco Freibert , Andrew Swann

A famous result of D. Walkup is that an $m\times n$ rectangle may be tiled by T-tetrominos if and only if both $m$ and $n$ are multiples of 4. The "if" portion may be proved by tiling a $4\times 4$ block, and then copying that block to fill…

Combinatorics · Mathematics 2024-02-05 Emily Feller , Robert Hochberg

Let $S$ be a nonorientable surface of genus $g\ge 5$ with $n\ge 0$ punctures, and $\Mcg(S)$ its mapping class group. We define the complexity of $S$ to be the maximum rank of a free abelian subgroup of $\Mcg(S)$. Suppose that $S_1$ and…

Geometric Topology · Mathematics 2017-01-03 Ferihe Atalan , Błażej Szepietowski

We study an agglomerative clustering problem motivated by interactive glyphs in geo-visualization. Consider a set of disjoint square glyphs on an interactive map. When the user zooms out, the glyphs grow in size relative to the map,…

Data Structures and Algorithms · Computer Science 2018-05-15 Thom Castermans , Bettina Speckmann , Frank Staals , Kevin Verbeek

Suppose $\Omega\subseteq\RR^d$ is a bounded and measurable set and $\Lambda \subseteq \RR^d$ is a lattice. Suppose also that $\Omega$ tiles multiply, at level $k$, when translated at the locations $\Lambda$. This means that the…

Classical Analysis and ODEs · Mathematics 2013-05-14 Mihail N. Kolountzakis

Let $R$ be an algebra over a ring $\Bbbk$, $T$ an $R$-algebra, $M$ a finitely generated projective $R$-module, and $N$ a $T$-module. Let $G$ be a linearly reductive group scheme over $\Bbbk$ equipped with a representation…

While it is a classical result dating back to Dehn (1903) that squares composing a perfect rectangle must have rational side lengths, the arithmetic complexity of these tilings, specifically the growth of the denominators of these rational…

Combinatorics · Mathematics 2026-05-05 Paul Perrier

We study the nonlinear oscillator z'' + omega^2 z + g(t) z^2 = 0 with a time-dependent coefficient g(t). We show that this equation admits an exact quadratic invariant I(z,p,t) provided that g(t) = alpha2(t)^(-5/2) and that alpha2(t)…

Dynamical Systems · Mathematics 2025-11-19 Johannes Hagel

We propose a novel stochastic smoothing accelerated gradient (SSAG) method for general constrained nonsmooth convex composite optimization, and analyze the convergence rates. The SSAG method allows various smoothing techniques, and can deal…

Optimization and Control · Mathematics 2026-02-03 Ruyu Wang , Chao Zhang

We revisit the global phase diagram of magic-angle twisted bilayer and [symmetric] trilayer graphene (MA-TBG/TSTG) in light of recent scanning tunneling microscopy (STM) measurements on these materials. These experiments both confirmed the…

Strongly Correlated Electrons · Physics 2025-09-17 Ziwei Wang , Glenn Wagner , Yves H. Kwan , Nick Bultinck , Steven H. Simon , S. A. Parameswaran

It is shown that every tree of size $n$ over a fixed set of $\sigma$ different ranked symbols can be decomposed (in linear time as well as in logspace) into $O\big(\frac{n}{\log_\sigma n}\big) = O\big(\frac{n \log \sigma}{\log n}\big)$ many…

Data Structures and Algorithms · Computer Science 2015-09-22 Moses Ganardi , Danny Hucke , Artur Jez , Markus Lohrey , Eric Noeth

The degree of a map between orientable manifolds is a fundamental concept in topology, providing deep insights into the structure of manifolds and the behavior of maps between them. Recently, this notion has been extensively studied,…

Geometric Topology · Mathematics 2026-03-24 Biplab Basak , Raju Kumar Gupta , Ayushi Trivedi

We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…

Combinatorics · Mathematics 2025-07-10 Jinjin Liang , Yixi Liao , Wenchuan Hu , Erxiao Wang

We prove that the least area of the non-contractible immersed spheres is no more than $4\pi$ in any oriented compact manifold with dimension $n+2\leq 7$ which satisfies $R\geq 2$ and admits a map to $\mathbf S^2\times T^n$ with nonzero…

Differential Geometry · Mathematics 2019-03-29 Jintian Zhu

We study in which way Kolmogorov complexity and instance complexity affect properties of r.e. sets. We show that the well-known 2log n upper bound on the Kolmogorov complexity of initial segments of r.e.\ sets is optimal and characterize…

Logic · Mathematics 2009-09-25 Martin Kummer

We give a fast algorithm for computing an irreducible triangulation $T^\prime$ of an oriented, connected, boundaryless, and compact surface $S$ in $E^d$ from any given triangulation $T$ of $S$. If the genus $g$ of $S$ is positive, then our…

Geometric Topology · Mathematics 2023-12-19 Suneeta Ramaswami , Marcelo Siqueira

We study the problem of maximizing the geometric mean of $d$ low-degree non-negative forms on the real or complex sphere in $n$ variables. We show that this highly non-convex problem is NP-hard even when the forms are quadratic and is…

Optimization and Control · Mathematics 2021-03-23 Chenyang Yuan , Pablo A. Parrilo