Related papers: Efficient Squares and Turing Universality at Tempe…

Let n integer greater or equal to 4 and even and let T_n be the set of ribbon L-shaped n-ominoes. We study tiling problems for regions in a square lattice by T_n. Our main result shows a remarkable rigidity property: a tiling of the first…

We introduce a new DNA tile self-assembly model: the Surface Flexible Tile Assembly Model (SFTAM), where 2D tiles are placed on host 3D surfaces made of axis-parallel unit cubes glued together by their faces, called polycubes. The bonds are…

We analyze the number of tile types $t$, bins $b$, and stages necessary to assemble $n \times n$ squares and scaled shapes in the staged tile assembly model. For $n \times n$ squares, we prove $\mathcal{O}(\frac{\log{n} - tb - t\log t}{b^2}…

We quantify the transition between weak and strong coupling in thermal ${\cal N}=4$ supersymmetric Yang--Mills (SYM) theory in four space-time dimensions by constructing an \emph{admissible ensemble} of log-aware Pad\'e approximants that…

The class of support $\tau$-tilting modules was introduced to provide a completion of the class of tilting modules from the point of view of mutations. In this article we study $\tau$-tilting finite algebras, i.e. finite dimensional…

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…

Put n nonoverlapping squares inside the unit square. Let f(n) and g(n) denote the maximum values of the sum of the edge lengths of the n small squares, where in the case of f(n) the maximum is taken over all arbitrary packings of the unit…

Expanding upon the widely recognized notion of mathematical universality in Turing machines, a concept of thermodynamic universality in Turing machines is introduced. Under the physical Church-Turing thesis, the existence of a…

Nanomechanical computers promise a greatly improved energetic efficiency compared to their electrical counterparts. However, progress towards this goal is hindered by a lack of modular components, such as logic gates or transistors, and…

It is demonstrated that any almost-tilting module over a gentle algebra is indeed partial-tilting, meaning it can be completed as a tilting module. Furthermore, such a module has at most $2n$ possible complements, thereby confirming a…

Self-assembly is one of the prevalent strategies used by living systems to fabricate ensembles of precision nanometer-scale structures and devices. The push for analogous approaches to create synthetic nanomaterials has led to the…

We introduce a new type of generalized Turing machines (GTMs), which are intended as a tool for the mathematician who studies computability in Analysis. In a single tape cell a GTM can store a symbol, a real number, a continuous real…

We study the behaviour of the interquark potential in lattice gauge theories at high temperature, but still in the confining phase, and propose a new observable which could play in this regime the same role played by the Luscher term in the…

In this paper we consider the problem of the strict self-assembly of infinite fractals within tile self-assembly. In particular, we provide tile assembly algorithms for the assembly of the discrete Sierpinski triangle and the discrete…

We give a general, direct and explicit construction of lower-bounded generalized twisted modules satisfying a universal property for a grading-restricted vertex (super)algebra $V$ associated to an automorphism $g$ of $V$. In particular,…

In this paper, we study some properties of a certain kind of permutation $\sigma$ over $\mathbb{F}_{2}^{n}$, where $n$ is a positive integer. The desired properties for $\sigma$ are: (1) the algebraic degree of each component function is…

In this paper, we introduce a novel design paradigm for modular architectured materials that allows for spatially nonuniform designs from a handful of building blocks, which can be robotically assembled for efficient and scalable…

We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic quantum computation using a one-dimensional quantum system (with…

Crystallographic texture engineering in ceramics is essential to achieve direction-specific properties. Current texture engineering methods are time-consuming, energy extensive, or can lead to unnecessary diffusion of added dopants. Herein,…

We elaborate on a new recursive method proposed in arXiv:2312.15484 for computing tree-level $n$-point supergluon amplitudes as well as those with one gluon, i.e., spinning amplitudes, in ${\rm AdS}_5 \times S^3$. We present an improved…