Related papers: Pattern overlap implies runaway growth in hierarch…
We introduce a partial decidability protocol for the Wang tiling problem (which is the prototype of undecidable problems in combinatorics and statistical physics) by constructing a suitable mapping from tilings of finite squares of…
A growth mechanism for a perfect one-dimensional (1D) quasiperiodic structure is presented with a local covering rule. We use rectangular tiles with two different types of string decorations. The string position in a tile is allowed to move…
A longstanding open problem asks for an aperiodic monotile, also known as an "einstein": a shape that admits tilings of the plane, but never periodic tilings. We answer this problem for topological disk tiles by exhibiting a continuum of…
We construct an example of an iterated function system on the line, consisting of linear fractional transformations, such that two of the maps share a fixed points, but the dimension of the attractor equals the conformal dimension, so that…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
Shi tableaux are special binary fillings of certain Young diagrams which arise in the study of Shi hyperplane arrangements related to classical root systems. For type $A$, the set $\mathcal T$ of Shi tableaux naturally coincides with the…
We consider a class of continuous-time stochastic growth models on $d$-dimensional lattice with non-negative real numbers as possible values per site. The class contains examples such as binary contact path process and potlatch process. We…
We develop large sample theory for merged data from multiple sources. Main statistical issues treated in this paper are (1) the same unit potentially appears in multiple datasets from overlapping data sources, (2) duplicated items are not…
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lovasz to determine the Shannon capacity of the pentagon; to show a direct sum theorem for…
A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with probability p, independently of the others. We prove that…
Supercomputing systems today often come in the form of large numbers of commodity systems linked together into a computing cluster. These systems, like any distributed system, can have large numbers of independent hardware components…
Chen and Cheng [Ann. Statist. 34 (2006) 546--558] discussed the method of doubling for constructing two-level fractional factorial designs. They showed that for $9N/32\le n\le 5N/16$, all minimum aberration designs with $N$ runs and $n$…
Tile-based self-assembly systems are capable of universal computation and algorithmically-directed growth. Systems capable of such behavior typically make use of "glue cooperation" in which the glues on at least $2$ sides of a tile must…
We investigate the structure of return-time sets determined by orbits along polynomial tuples in minimal topological dynamical systems. Building on the topological characteristic factor theory of Glasner, Huang, Shao, Weiss, and Ye, we…
We continue developing the theory around the twin-width of totally ordered binary structures, initiated in the previous paper of the series. We first introduce the notion of parity and linear minors of a matrix, which consists of…
This paper concerns non-overlapping codes, block codes motivated by synchronisation and DNA-based storage applications. Most existing constructions of these codes do not account for the restrictions posed by the physical properties of…
We present a principled approach for detecting overlapping temporal community structure in dynamic networks. Our method is based on the following framework: find the overlapping temporal community structure that maximizes a quality function…
Winfree's abstract Tile Assembly Model (aTAM) is a model of molecular self-assembly of DNA complexes known as tiles, which float freely in solution and attach one at a time to a growing "seed" assembly based on specific binding sites on…
Motivated by the development and deployment of large-scale dynamical systems, often composed of geographically distributed smaller subsystems, we address the problem of verifying their controllability in a distributed manner. In this work…
We define the Reflexive Tile Assembly Model (RTAM), which is obtained from the abstract Tile Assembly Model (aTAM) by allowing tiles to reflect across their horizontal and/or vertical axes. We show that the class of directed temperature-1…