English
Related papers

Related papers: Self-Assembly of Infinite Structures

200 papers

We prove the computational weakness of a model of tile assembly that has so far resisted many attempts of formal analysis or positive constructions. Specifically, we prove that, in Winfree's abstract Tile Assembly Model, when restricted to…

Computational Complexity · Computer Science 2015-07-31 Pierre-Étienne Meunier , Damien Regnault

We use analytic theory and computer simulation to study patterns formed during the growth of two-component assemblies in 2D and 3D. We show that these patterns undergo a nonequilibrium phase transition, at a particular growth rate, between…

Statistical Mechanics · Physics 2014-05-12 Stephen Whitelam , Lester O. Hedges , Jeremy D. Schmit

We prove a result which strongly hints at the computational weakness of a model of tile assembly that has so far resisted many attempts of formal analysis or positive constructions. Specifically, we prove that, in Winfree's abstract Tile…

Computational Complexity · Computer Science 2016-10-28 Pierre-Étienne Meunier , Damien Regnault

This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that…

Adaptation and Self-Organizing Systems · Physics 2009-09-29 Hiroki Sayama

We study the decidability of the topological properties of some objects coming from fractal geometry. We prove that having empty interior is undecidable for the sets defined by two-dimensional graph-directed iterated function systems. These…

Formal Languages and Automata Theory · Computer Science 2014-09-26 Timo Jolivet , Jarkko Kari

In recent years, there has been much progress in the field of structural Ramsey theory, in particular in the study of big Ramsey degrees. In all known examples of infinite structures with finite big Ramsey degrees, there is in fact a single…

Logic · Mathematics 2025-10-01 Jan Hubička , Andy Zucker

Finite Turing computation has a fundamental symmetry between inputs, outputs, programs, time, and storage space. Standard models of transfinite computational break this symmetry; we consider ways to recover it and study the resulting model…

Logic · Mathematics 2023-02-14 Lorenzo Galeotti , Ethan S. Lewis , Benedikt Löwe

We consider the self-assembly of fractals in one of the most well-studied models of tile based self-assembling systems known as the Two-handed Tile Assembly Model (2HAM). In particular, we focus our attention on a class of fractals called…

Emerging Technologies · Computer Science 2018-10-12 Jacob Hendricks , Joseph Opseth

L-Infinity structures have been a subject of recent interest in physics, where they occur in closed string theory and in gauge theory. This paper provides a class of easily constructible examples of $L_n$ and $L_{\infty}$ structures on…

Quantum Algebra · Mathematics 2007-05-23 Marilyn Daily

In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…

Logic · Mathematics 2024-06-10 Jorge Antonio Cruz Chapital

A new (in)finite dimensional algebra which is a fundamental dynamical symmetry of a large class of (continuum or lattice) quantum integrable models is introduced and studied in details. Finite dimensional representations are constructed and…

Mathematical Physics · Physics 2014-11-18 P. Baseilhac , K. Koizumi

Self-assembly in natural and synthetic molecular systems can create complex aggregates or materials whose properties and functionality rises from their internal structure and molecular arrangement. The key microscopic features that control…

Soft Condensed Matter · Physics 2021-09-03 Alberto Scacchi , Maria Sammalkorpi , Tapio Ala-Nissila

This paper presents a novel approach to constructing finite generating sets for infinitely generated ideals. By integrating algebraic and computational techniques, we provide a method to identify finite generators, demonstrated through…

Commutative Algebra · Mathematics 2025-08-08 Takafumi Shibuta

For every $p\geq 2$ we show that each finite $p$-group with an unmixed Beauville structure is part of a surjective infinite projective system of finite $p$-groups with compatible unmixed Beauville structures. This leads to the new notion of…

Group Theory · Mathematics 2015-07-21 Jakob Stix , Alina Vdovina

We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K;…

Group Theory · Mathematics 2015-02-10 Tomasz Downarowicz , Dawid Huczek , Guohua Zhang

We show that in the hierarchical tile assembly model, if there is a producible assembly that overlaps a nontrivial translation of itself consistently (i.e., the pattern of tile types in the overlap region is identical in both translations),…

Computational Geometry · Computer Science 2014-11-26 Ho-Lin Chen , David Doty , Ján Maňuch , Arash Rafiey , Ladislav Stacho

In this note we prove that every finite collection of connected algebraic subgroups of the group of triangular automorphisms of the affine space generates a connected solvable algebraic subgroup.

Algebraic Geometry · Mathematics 2022-03-15 Ivan Arzhantsev , Kirill Shakhmatov

This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…

Dynamical Systems · Mathematics 2020-11-30 Michael F. Barnsley , Louisa F. Barnsley , Andrew Vince

We begin the study of the consequences of the existence of certain infinite matrices. Our present application is to compactness of products of topological spaces.

Logic · Mathematics 2008-03-26 Paolo Lipparini

In this paper we show that passive self-assembly in the context of the tile self-assembly model is capable of performing fuel efficient, universal computation. The tile self-assembly model is a premiere model of self-assembly in which…

Data Structures and Algorithms · Computer Science 2012-08-09 Robert Schweller , Michael Sherman