Related papers: Partial decidability protocol for the Wang tiling …
We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…
The three-dimensional bimodal random-field Ising model is investigated using the N-fold version of the Wang-Landau algorithm. The essential energy subspaces are determined by the recently developed critical minimum energy subspace…
We construct a nontrivial three-dimensional subshift of finite type whose projective $\Z$-subdynamics, or $\Z$-trace, is 2-sparse, meaning that there are at most two nonzero symbols in any vertical column. The subshift is deterministic in…
Strand displacement and tile assembly systems are designed to follow prescribed kinetic rules (i.e., exhibit a specific time-evolution). However, the expected behavior in the limit of infinite time--known as thermodynamic equilibrium--is…
This paper deals with the complexity of some natural graph problems when parametrized by {measures that are restrictions of} clique-width, such as modular-width and neighborhood diversity. The main contribution of this paper is to introduce…
This note is intended to foster a discussion about the extent to which typical problems arising in quantum information theory are algorithmically decidable (in principle rather than in practice). Various problems in the context of…
Identical classical particles are distinguishable. This distinguishability affects the number of ways W a macrostate can be realized on the micro-level, and from the relation S = k ln W leads to a non-extensive expression for the entropy.…
We study the ternary quadratic problem (TQP), a quadratic optimization problem with linear constraints where the variables take values in $\{0, \pm 1\}$. While semidefinite programming (SDP) techniques are well established for $\{0,1\}$-…
We introduce a family of domino tilings that includes tilings of the Aztec diamond and pyramid partitions as special cases. These tilings live in a strip of $\mathbb{Z}^2$ of the form $1 \leq x-y \leq 2\ell$ for some integer $\ell \geq 1$,…
Given a graph $G$ and collection of subgraphs $T$ (called tiles), we consider covering $G$ with copies of tiles in $T$ so that each vertex $v\in G$ is covered with a predetermined multiplicity. The multinomial tiling model is a natural…
We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…
Algorithmic entropy can be seen as a special case of entropy as studied in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics to the subject of algorithmic information theory. In…
The problem of rectangle tiling binary arrays is defined as follows. Given an $n \times n$ array $A$ of zeros and ones and a natural number $p$, our task is to partition $A$ into at most $p$ rectangular tiles, so that the maximal weight of…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
We study phase transitions in the thermodynamic description of Pomeau-Manneville intermittent maps from the point of view of infinite ergodic theory, which deals with diverging measure dynamical systems. For such systems, we use a…
The decay rate for a particle in a metastable cubic potential is investigated in the quantum regime by the Euclidean path integral method in semiclassical approximation. The imaginary time formalism allows one to monitor the system as a…
Nonadiabatic unitary evolution with tailored time-dependent Hamiltonians can prepare systems of cold atomic gases with various desired properties. For a system of two one-dimensional quasicondensates coupled with a time-varying tunneling…
We consider a network coding setting where some of the messages and edges have fixed alphabet sizes, that do not change when we increase the common alphabet size of the rest of the messages and edges. We prove that the problem of deciding…
It is shown that the von Neumann entropy, a measure of quantum entanglement, does have its classical counterpart in thermodynamic systems, which we call partial entropy. Close to the critical temperature the partial entropy shows perfect…
Topologically ordered quantum matter exhibits intriguing long-range patterns of entanglement, which reveal themselves in subsystem entropies. However, measuring such entropies, which can be used to certify topological order, on large…