Related papers: Enumeration of octagonal tilings
We consider the situation when a globally defined four-dimensional field system is separated on two entangled sub-systems by a dynamical (random) two-dimensional surface. The reduced density matrix averaged over ensemble of random surfaces…
We consider tiles of some fixed size, with an associated weighting on the shapes of tile, of total mass 1. We study the pressure, $p$, of tilings with those tiles; the pressure, one over the volume times the logarithm of the partition…
The paper considers ribbon tilings of large regions and their per-tile entropy (the logarithm of the number of tilings divided by the number of tiles). For tilings of general regions by ribbon tiles of length $n$, we give an upper bound on…
Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…
We show how to compute the probability of any given local configuration in a random tiling of the plane with dominos. That is, we explicitly compute the measures of cylinder sets for the measure of maximal entropy $\mu$ on the space of…
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…
All edge-to-edge tilings of the sphere by congruent regular triangles and congruent rhombi are classified as: (1) a $1$-parameter family of protosets each admitting a unique $(2a^3,3a^4)$-tiling like a triangular prism; (2) a $1$-parameter…
Entropy is a quantity for counting physical degrees of freedom in a system. At a finite temperature, one can use thermal entropy to study thermodynamical properties. At zero temperature, entanglement entropy is expected to provide a…
We study entropy-bounded computational geometry, that is, geometric algorithms whose running times depend on a given measure of the input entropy. Specifically, we introduce a measure that we call range-partition entropy, which unifies and…
The combinatorics of tilings of a hexagon of integer side-length $n$ by 120 degree - 60 degree diamonds of side-length 1 has a long history, both directly (as a problem of interest in thermodynamic models) and indirectly (through the…
This paper considers $n$-ribbon tilings of general regions and their per-tile entropy (the binary logarithm of the number of tilings divided by the number of tiles). We show that the per-tile entropy is bounded above by $\log_2 n$. This…
A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We…
This paper deals with (globally) random substitutions on a finite set of prototiles. Using renormalization tools applied to objects from operator algebras we establish upper and lower bounds on the rate of deviations of ergodic averages for…
Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…
Let A be a matrix, c be any linear objective function and x be a fractional vector, say an LP solution to some discrete optimization problem. Then a recurring task in theoretical computer science (and in approximation algorithms in…
We present a technique for the enumeration of all isotopically distinct ways of tiling a hyperbolic surface of finite genus, possibly nonorientable and with punctures and boundary. This provides a generalization of the enumeration of…
We calculate the generating functions for the number of tilings of rectangles of various widths by the right tromino, the $L$ tetromino, and the $T$ tetromino. This allows us to place lower bounds on the entropy of tilings of the plane by…
We study the effect of the choice of embedding geometry on the entropy of random geometric graph ensembles with soft connection functions. First we show that when the connection range is small, the entropy is dependent only on the dimension…
The assembly of molecular networks into structures such as random tilings and glasses has recently been demonstrated for a number of two-dimensional systems. These structures are dynamically-arrested on experimental timescales so the…
We study a random aggregation process involving rectangular clusters. In each aggregation event, two rectangles are chosen at random and if they have a compatible side, either vertical or horizontal, they merge along that side to form a…