Related papers: Faultfree Tromino Tilings of Rectangles

We consider the number of domino tilings of an odd-by-odd rectangle that leave one hole. This problem is equivalent to the number of near-perfect matchings of the odd-by-odd rectangular grid. For any particular position of the vacancy on…

Starting with a substitution tiling, we demonstrate a method for constructing infinitely many new substitution tilings. Each of these new tilings is derived from a graph iterated function system and the tiles have fractal boundary. We show…

An $N$-tiling of triangle $ABC$ by triangle $T$ (the `tile') is a way of writing $ABC$ as a union of $N$ copies of $T$ overlapping only at their boundaries. Let the tile $T$ have angles $(\alpha,\beta,\gamma)$, and sides $(a,b,c)$. This…

A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…

We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…

We consider the problem of counting and classifying domino tilings of a quadriculated torus. The counting problem for rectangles was studied by Kasteleyn and we use many of his ideas. Domino tilings of planar regions can be represented by…

A domino covering of a board is saturated if no domino is redundant. We introduce the concept of a fragment tiling and show that a minimal fragment tiling always corresponds to a maximal saturated domino covering. The size of a minimal…

We describe a procedure that creates an explicit complex-valued polynomial function of three-dimensional space, whose nodal lines are the three-twist knot $5_2$. The construction generalizes a similar approach for lemniscate knots: a braid…

We describe computer algorithms that produce the complete set of isohedral tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups of…

In this work, we give a method to obtain nontrivial transitive perfect colorings of the non-regular Archimedean tilings using the least possible number $n$ of colors. We also look for other non-equivalent transitive perfect $n$-colorings of…

The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. Begin with a complete graph on $n$ vertices and proceed to remove the edges of triangles one at a time, where each triangle removed is…

This chapter deals with the exact enumeration of certain classes of self-avoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of…

We construct perfect t-embeddings for regular hexagons of the hexagonal lattice, providing the first example, and hence proving existence, for graphs with an outer face of degree greater than four. The construction is in terms of the…

New tilings of certain subsets of $\mathbb{R}^{M}$ are studied, tilings associated with fractal blow-ups of certain similitude iterated function systems (IFS). For each such IFS with attractor satisfying the open set condition, our…

An $n$-dimensional cross comprises $2n+1$ unit cubes: the center cube and reflections in all its faces. It is well known that there is a tiling of $R^{n}$ by crosses for all $n.$ AlBdaiwi and the first author proved that if $2n+1$ is not a…

We discuss how to construct limit shapes for the domino tiling model (square lattice dimer model) and $5$-vertex model, in appropriate polygonal domains. Our methods are based on the harmonic extension method of [R. Kenyon and I. Prause,…

We introduce a fractal version of the pinwheel substitution tiling. There are thirteen basic prototiles, all of which have fractal boundaries. These tiles, along with their reflections and rotations, create a tiling space which is mutually…

We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of…

We show that the size of a 4-critical graph of girth at least five is bounded by a linear function of its genus. This strengthens the previous bound on the size of such graphs given by Thomassen. It also serves as the basic case for the…

Given a collection of N rectangles such that the side ratio of each one is a quadratic irrationality, we find all rectangles which can be tiled by rectangles similar to one of the given ones. It means that each possible shape can be used…