English
Related papers

Related papers: Pattern overlap implies runaway growth in hierarch…

200 papers

We prove that certain families of homogenous affine iterated function systems in $\mathbb{R}^d$ have the property that the open set condition and the existence of exact overlaps both occur densely in the space of translation parameters.…

Metric Geometry · Mathematics 2022-03-08 Ian D. Morris

Empirical data, on which deep learning relies, has substantial internal structure, yet prevailing theories often disregard this aspect. Recent research has led to the definition of structured data ensembles, aimed at equipping established…

Disordered Systems and Neural Networks · Physics 2023-11-13 Andrea Baroffio , Pietro Rotondo , Marco Gherardi

Theories of phase change and self-assembly often invoke the idea of a `quasiequilibrium', a regime in which the nonequilibrium association of building blocks results nonetheless in a structure whose properties are determined solely by an…

Statistical Mechanics · Physics 2013-07-22 Stephen Whitelam , Rebecca Schulman , Lester Hedges

Let $X$ be any rational surface. We construct a tilting bundle $T$ on $X$. Moreover, we can choose $T$ in such way that its endomorphism algebra is quasi-hereditary. In particular, the bounded derived category of coherent sheaves on $X$ is…

Algebraic Geometry · Mathematics 2017-06-27 Lutz Hille , Markus Perling

Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…

Classical Analysis and ODEs · Mathematics 2025-09-25 Sigrid Grepstad , Mihail N. Kolountzakis , Emmanuil Spyridakis

Writing formal specifications for distributed systems is difficult. Even simple consistency requirements often turn out to be unrealizable because of the complicated information flow in the distributed system: not all information is…

Logic in Computer Science · Computer Science 2017-01-11 Bernd Finkbeiner , Leander Tentrup

Many physical systems are well described on domains which are relatively large in some directions but relatively thin in other directions. In this scenario we typically expect the system to have emergent structures that vary slowly over the…

Dynamical Systems · Mathematics 2016-12-15 A. J. Roberts , J. E. Bunder

A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…

Combinatorics · Mathematics 2007-05-23 Ethan M. Coven , William Geller , Sylvia Silberger , William P. Thurston

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior

Moir\'e patterns are omnipresent. They are important for any overlapping periodic phenomenon, from vibrational and electromagnetic, to condensed matter. Here we show, both theoretically and via experimental simulations by ultracold atoms,…

We establish a structure theorem for the family of Ammann A2 tilings of the plane. Using that theorem we show that every Ammann A2 tiling is self-similar in the sense of [B. Solomyak, Nonperiodicity implies unique composition for…

Logic · Mathematics 2018-02-21 Bruno Durand , Alexander Shen , Nikolay Vereshchagin

Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of…

Logic in Computer Science · Computer Science 2015-07-01 Stefan Wöhrle , Wolfgang Thomas

Manufacturing systems of the future need to have flexible resources and flexible routing to produce extremely personalized products, even of lot size equal to one. In this paper, we have proposed a framework, which is designed to achieve…

Computers and Society · Computer Science 2019-05-22 Kashif Zia , Alois Ferscha , Dari Trendafilov

In this paper we demonstrate the power of a model of tile self-assembly based on active glues which can dynamically change state. We formulate the Signal-passing Tile Assembly Model (STAM), based on the model of Padilla, Liu, and Seeman to…

We study the diagonals of two-dimensional tilings generated by direct product substitutions. The properties of these diagonals are primarily determined by the eigenvalues of the substitution matrix, but also the order of the letters in the…

Dynamical Systems · Mathematics 2013-02-18 Michel Dekking

Self-organization, the ability of a system of microscopically interacting entities to shape macroscopically ordered structures, is ubiquitous in Nature. Spatio-temporal patterns are abundantly observed in a large plethora of applications,…

Pattern Formation and Solitons · Physics 2019-06-17 Malbor Asllani , Timoteo Carletti , Duccio Fanelli , Philip K. Maini

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

Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…

Combinatorics · Mathematics 2024-09-16 Swee Hong Chan , Igor Pak

A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…

Combinatorics · Mathematics 2011-03-10 Thomas Fernique , Nicolas Ollinger

Let $T$ be a tile in $\mathbb{Z}^n$, meaning a finite subset of $\mathbb{Z}^n$. It may or may not tile $\mathbb{Z}^n$, in the sense of $\mathbb{Z}^n$ having a partition into copies of $T$. However, we prove that $T$ does tile $\mathbb{Z}^d$…

Combinatorics · Mathematics 2016-08-23 Vytautas Gruslys , Imre Leader , Ta Sheng Tan