English
Related papers

Related papers: T-Tetrominos in Arithmetic Progression

200 papers

First, we consider order-$n$ ribbon tilings of an $M$-by-$N$ rectangle $R_{M,N}$ where $M$ and $N$ are much larger than $n$. We prove the existence of the growth rate $\gamma_n$ of the number of tilings and show that $\gamma_n \leq (n-1)…

Combinatorics · Mathematics 2023-07-04 Yinsong Chen , Vladislav Kargin

We say that a triangle $T$ tiles a polygon $A$, if $A$ can be dissected into finitely many nonoverlapping triangles similar to $T$. We show that if $N>42$, then there are at most three nonsimilar triangles $T$ such that the angles of $T$…

Metric Geometry · Mathematics 2020-02-28 M. Laczkovich

In this paper, we give some sufficient conditions for a $n$-dimensional rectangle to be tiled with a set of bricks. These conditions are obtained by using the so-called Frobenius number.

Combinatorics · Mathematics 2007-05-23 J. Ramirez Alfonsin

The number of domino tilings of a region with reflective symmetry across a line is combinatorially shown to depend on the number of domino tilings of particular subregions, modulo 4. This expands upon previous congruency results for domino…

Combinatorics · Mathematics 2009-05-12 Bridget Eileen Tenner

In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…

History and Overview · Mathematics 2011-11-30 Sultan Hussain , Usman Ali

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…

Combinatorics · Mathematics 2007-05-23 Cristopher Moore

A tiling is a decomposition of a polygon into finitely many non-overlapping triangles. We prove that if a regular n-gon, $n \geq 5$, $n \neq 28$, can be tiled with similar right triangles, then one of the angles of these triangles is in…

Combinatorics · Mathematics 2021-02-23 Ivan Vasenov

Rudolph showed that the orbits of any measurable, measure preserving $\mathbb R^d$ action can be measurably tiled by $2^d$ rectangles and asked if this number of tiles is optimal for $d>1$. In this paper, using a tiling of $\mathbb R^d$ by…

Dynamical Systems · Mathematics 2014-05-12 Bryna Kra , Anthony Quas , Ayse Sahin

Given a periodic placement of copies of a tromino (either L or I), we prove co-RE-completeness (and hence undecidability) of deciding whether it can be completed to a plane tiling. By contrast, the problem becomes decidable if the initial…

We consider domino tilings of three-dimensional cubiculated regions. A flip is a local move: two neighboring parallel dominoes are removed and placed back in a different position. The twist is an integer associated to each tiling, which is…

Combinatorics · Mathematics 2022-01-14 Nicolau C. Saldanha

In this paper we consider faultfree tromino tilings of rectangles and characterize rectangles that admit such tilings. We introduce the notion of {\it crossing numbers} for tilings and derive bounds on the crossing numbers of faultfree…

Combinatorics · Mathematics 2007-05-23 Mridul Aanjaneya , Sudebkumar Prasant Pal

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…

Combinatorics · Mathematics 2016-01-26 Fillipo Impellizieri

Tilings are around us everywhere, and our curiosity draws us to study their properties. A tiling is a way of arranging pieces on a board, such that there is no space left uncovered, nor any space covered by more than one tile. In…

History and Overview · Mathematics 2019-12-11 Emily Montelius

We study the computational power of the Full-Tilt model of motion planning, where slidable polyominos are moved maximally around a board by way of a sequence of directional ``tilts.'' We focus on the deterministic scenario in which the…

The author presents two tricks to accelerate depth-first search algorithms for a class of combinatorial puzzle problems, such as tiling a tray by a fixed set of polyominoes. The first trick is to implement each assumption of the search with…

Data Structures and Algorithms · Computer Science 2009-09-25 Donald E. Knuth

Let $m,k$ be fixed positive integers. Determining the generating function for the number of tilings of an $m\times n$ rectangle by $k\times 1$ rectangles is a long-standing open problem to which the answer is only known in certain special…

Combinatorics · Mathematics 2022-08-09 Mudit Aggarwal , Samrith Ram

We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.

Combinatorics · Mathematics 2009-09-25 Richard Kenyon

Motivated by targeted drug delivery, we investigate the gathering of particles in the full tilt model of externally controlled motion planning: A set of particles is located at the tiles of a polyomino with all particles reacting uniformly…

Computational Geometry · Computer Science 2026-03-04 Sándor P. Fekete , Jonas Friemel , Peter Kramer , Jan-Marc Reinhardt , Christian Rieck , Christian Scheffer

We study here slopes of periodicity of tilings. A tiling is of slope if it is periodic along direction but has no other direction of periodicity. We characterize in this paper the set of slopes we can achieve with tilings, and prove they…

Discrete Mathematics · Computer Science 2010-12-08 Emmanuel Jeandel , Pascal Vanier

We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…

Metric Geometry · Mathematics 2018-11-28 Richard Evan Schwartz