Related papers: A Note on Tiling under Tomographic Constraints
We prove that the number of monomer-dimer tilings of an $n\times n$ square grid, with $m<n$ monomers in which no four tiles meet at any point is $m2^m+(m+1)2^{m+1}$, when $m$ and $n$ have the same parity. In addition, we present a new proof…
We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested…
Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem…
In this paper we extend counting of traversing Hamiltonian cycles from 2-tiled graphs to generalized tiled graphs. We further show that, for a fixed finite set of tiles, counting traversing Hamiltonian cycles can be done in linear time with…
An equilateral triangle cannot be dissected into finitely many mutually incongruent equilateral triangles [Tutte 1948]. Therefore Tuza [Tuza 1991] asked for the largest number $s=s(n)$ such that there is a tiling of an equilateral triangle…
We study the following combinatorial problem. Given a set of $n$ y-monotone curves, which we call wires, a tangle determines the order of the wires on a number of horizontal layers such that any two consecutive layers differ only in swaps…
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…
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…
We show that a square-tiling of a $p\times q$ rectangle, where $p$ and $q$ are relatively prime integers, has at least $\log_2p$ squares. If $q>p$ we construct a square-tiling with less than $q/p+C\log p$ squares of integer size, for some…
The periodic tiling conjecture asserts that if a region $\Sigma\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was…
This article is dedicated to domino tilings of square grids. In each of these grids domino tilings are represented using linear-recurrent sequences. For different grids are determined new dependencies.
In this paper, we introduce a generalization of a class of tilings which appear in the literature: the tilings over which a height function can be defined (for example, the famous tilings of polyominoes with dominoes). We show that many…
An h-tiling on a finite simplicial complex is a partition of its geometric realization by maximal simplices deprived of several codimension one faces together with possibly their remaining face of highest codimension. In this last case, the…
Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in $\mathbb{Z}_{2^L}^n$ by subsets, in the case that the constellation does not possess an abelian…
In this paper we study two problems related to the drawing of level graphs, that is, T-LEVEL PLANARITY and CLUSTERED-LEVEL PLANARITY. We show that both problems are NP-complete in the general case and that they become polynomial-time…
It has been common knowledge since 1950 that seven colours can be assigned to tiles of an infinite honeycomb with cells of unit diameter such that no two tiles of the same colour are closer than $d(7)=\frac{\sqrt{7}}{2}$ apart. Various…
A tiling of the unit square is an MTP tiling if the smallest tile can tile all the other tiles. We look at the function $f(n)=\max \sum s_i$, where $s_i$ is the side length of the $i$th tile and the sum is taken over all MTP tilings with…
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…
We study tilings of regions in the square lattice with L-shaped trominoes. Deciding the existence of a tiling with L-trominoes for an arbitrary region in general is NP-complete, nonetheless, we identify restrictions to the problem where it…
This article shines new light on the classical problem of tiling rectangles with squares efficiently with a novel method. With a twist on the traditional approach of resistor networks, we provide new and improved results on the matter using…