Related papers: Octagonal tilings with three prototiles

In this paper we investigate a family of matroids introduced by Ardila and Billey to study one-dimensional intersections of complete flag arrangements of $\mathbb{C}^n$. The set of lattice points $P_n$ inside the equilateral triangle $S_n$…

A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…

MacMahon proved a simple product formula for the generating function of plane partitions fitting in a given box. The theorem implies a $q$-enumeration of lozenge tilings of a semi-regular hexagon on the triangular lattice. In this paper we…

We study nonperiodic tilings of the line obtained by a projection method with an interval projection structure. We obtain a geometric characterisation of all interval projection tilings that admit substitution rules and describe the set of…

Rotationally symmetric tilings by a convex pentagonal tile belonging to both the Type 1 and Type 7 families are introduced. Among them are spiral tilings with two- and four-fold rotational symmetry. Those rotationally symmetric tilings are…

We define a new family of non-periodic tilings with square tiles that is mutually locally derivable with some family of tilings with isosceles right triangles. Both families are defined by simple local rules, and the proof of their…

In this paper we present a new version of the second author's factorization theorem for perfect matchings of symmetric graphs. We then use our result to solve four open problems of Propp on the enumeration of trimer tilings on the hexagonal…

In this article the reduction of a $n$-dimensional space to a $k$-dimensional space is considered as a reduction of $N^n$ states to $N^k$ states, where $N$ stands for the number of single-particle states per unit of spatial length. It turns…

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…

A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…

We enumerate three specific permutation classes defined by two forbidden patterns of length four. The techniques involve inflations of geometric grid classes.

Let $\delta_0(P,k)$ denote the degree $k$ dilation of a point set $P$ in the domain of plane geometric spanners. If $\Lambda$ is the infinite square lattice, it is shown that $1+\sqrt{2} \leq \delta_0(\Lambda,3) \leq (3+2\sqrt2) \, 5^{-1/2}…

We have performed a complete enumeration of non-isotopic triples of mutually orthogonal $k\times n$ Latin rectangles for $k\leq n \leq 7$. Here we will present a census of such triples, classified by various properties, including the order…

We consider the problem of characterizing finite sets which tile the integers by translations. Coven and Meyerowitz (J. Algebra 1999) found necessary and sufficient conditions for a finite set A to tile the integers under the assumption…

We introduce and study a three-folded linear operator depending on three parameters that has associated a triangular number tilling of the plane. As a result the set of all triples of integers is decomposed in classes of equivalence…

In a region $R$ consisting of unit squares, a domino is the union of two adjacent squares and a (domino) tiling is a collection of dominoes with disjoint interior whose union is the region. The flip graph $\mathcal{T}(R)$ is defined on the…

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…

We consider the number of partitions of $n$ whose Young diagrams fit inside an $m \times \ell$ rectangle; equivalently, we study the coefficients of the $q$-binomial coefficient $\binom{m+\ell}{m}_q$. We obtain sharp asymptotics throughout…

The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…

Several variants of the classic Fibonacci inflation tiling are considered in an illustrative fashion, in one and in two dimensions, with an eye on changes or robustness of diffraction and dynamical spectra. In one dimension, we consider…