Questions tagged [tiling]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
2
votes
1answer
145 views

Objects in bijection with integer partitions (and lattices)

A partition of $n$ is a non-increasing sequence of positive integers of sum $n$. Several lattices are defined over integer partitions, in particular the dominance order and the Young lattice. Several ...
2
votes
0answers
60 views

Cutting polygons into mutually similar and non-congruent pieces

It is well-known that a square can be cut into a finite number of squares all of mutually different sides (hence mutually non-congruent) - for example, see https://en.wikipedia.org/wiki/...
27
votes
5answers
878 views

Fair cutting of the plane with lines

An infinite countable family $\cal{L}$ of lines in the plane $\mathbb{R}^2$ forms a fair cutting of the plane if the following conditions are satisfied: $\bullet$ No circle intersects infinitely many ...
0
votes
0answers
53 views

On Covering a Planar Region with Copies of a Tile of Different Shape

Background: Consider trying to cover the largest possible scaled copy of a planar region $C$ with specified shape with n instances of a tile $T$ of specified shape and size. Several families of this ...
5
votes
1answer
98 views

Random domino tilings: Is this distribution well-defined, and how can it be sampled from?

I'd like to ask questions about a "random domino tiling of the plane". However, it's not quite obvious how to go about precisely specifying what this means. My first instinct was to do ...
4
votes
0answers
71 views

If two convex polygons tile the plane, how many sides can one of them have?

The set of convex polygons which tile the plane is, as of $2017$, known: it consists of all triangles, all quadrilaterals, $15$ families of pentagons, and three families of hexagons. Euler's formula ...
19
votes
0answers
238 views

Does every 5-celled animal tile the plane?

An animal in the plane is a finite set of grid-aligned unit squares in $\mathbb{R}^2$. (The definition is the same as a polyomino, but where we relax the connectivity requirement.) One may ...
0
votes
1answer
103 views

maximum number of colors for an optimal tiling which guaranties infinite paths

This question is a more applicable version of the question I've asked in mathexchange recently: What is the maximum number of colors we can use to color $N^2$ square sub-tiles of $N×N$ square block ...
12
votes
3answers
680 views

Tiling a rectangle with all simply connected polyominoes of fixed size

For which values of $n$ can we tile some rectangle with one copy of each free simply-connected $n$-omino (that is, each polyomino with $n$ squares that has no holes)? It appears that it is possible ...
1
vote
0answers
37 views

How to tile a plane such that moving from one tile to the next in any of the 8 cardinal directions is the same length?

When tiling the euclidean plane with squares (like most board games), moving diagonally to another tile is longer than moving vertically or horizontally. Is there a tiling such that moving in any of ...
4
votes
0answers
71 views

Possible cardinalities of spherical tiling

Suppose that we have a tiling of $n$-dimensional (I want to get answer for $n = 4$, but general result would be nice!) sphere by isometric tiles strictly contained inside the right-angled simplex. ...
14
votes
0answers
290 views

Minimum number of distinct triangles for tesselating the sphere

Consider sequences of tesselations of the sphere. For instance, one such sequence might start with an icosahedron and proceed by subdividing each triangle face into 4 triangles and projecting the new ...
4
votes
1answer
135 views

Absolute and relative tilings of the hyperbolic plane

In Conway's Symmetries of Things on p. 265 I found these two tilings of the hyperbolic plane with the same vertex configuration $(3.5.3.5.3)$ (resp. vertex figure, as Conway calls it). The ...
0
votes
0answers
108 views

Graph theory: Closed neighourhoods and generalized clustering coefficients

The neighbourhood of node $v$ in graph $G$ is the subgraph of $G$ induced by all vertices adjacent to $v$. The number of edges between neighbours divided by the number of pairs of neighbours is ...
0
votes
0answers
25 views

Vertex configuration to tile repeat unit

I am working with elongated triangular tiling which has a vertex configuration of 3.3.3.4.4 and noticed that the representative symmetry is not the repeat unit. Is there a general formula to convert ...
2
votes
2answers
167 views

For what n and t can a square be partitioned into n similar rectangles in t congruence classes?

It is known that a square can be partitioned into three similar rectangles, all mutually non-congruent. I don't think it's possible with four. With what numbers of rectangles can this be achieved? And ...
5
votes
1answer
146 views

A claim on partitioning a convex planar region into congruent pieces

Let us define a perfect congruent partition of a planar region $R$ as a partition of it with no portion left over into some finite number n of pieces that are all mutually congruent (ie any piece can ...
3
votes
1answer
392 views

What is the representation of the generators of the triangle group for the uniform (4 4 4) tiling of hyperbolic disk as Mobius transformations?

I wonder how can one describe the generators of the triangle group for the tesselation of Poincare unit disk by triangles with angles $\pi/4, \pi/4 , \pi/4 $ in terms of the action of the modular ...
3
votes
0answers
70 views

Distance spectra of uniform tilings

Let a uniform tiling be defined by a vertex configuration $(n_1.n_2.\cdots.n_k)^m$, which is either spherical, Euclidean or hyperbolic. Assume that the tiling is vertex-transitive, especially that ...
4
votes
1answer
183 views

Structures for random graphs with structure

Background[You may skip this and go immediately to the Definitions.] Crucial features of a (random) graph or network are: the degree distribution $p(d)$ (exponential, Poisson, or power law) the mean ...
7
votes
6answers
438 views

Tiling with similar tiles

Question 1: Is there a polygon $P$ that cannot tile the plane and tiles the plane when copies of $P$ and some other polygon(s) all similar in shape to $P$ but of different size(s) can be used? ...
3
votes
1answer
146 views

Monotile that tiles when you apply a rubber band

My (non-mathematician) friend asked me a physics/tilings question that maybe someone here is interested in dissecting, or can point to the literature if this problem has been studied. Does there ...
3
votes
1answer
49 views

Tilings of lattice polytopes by transformations of lattice polytopes

A quasi-lattice polytope is a polytope obtained by reflections, translations, and rotations of lattice polytopes. In a tiling of a lattice polytope by quasi-lattice polytopes, are all quasi-lattice ...
1
vote
1answer
79 views

What does the extension theorem for tilings state?

I have seen several references to the so-called Extension Theorem in the context of tilings of Euclidean space. E.g. in "The Local Theorem for Monotypic Tilings" one reads The Extension Theorem [......
4
votes
2answers
332 views

Domino tiling obtained from space-filling curves, is possible to predict basic properties?

Periodic and aperiodic domino tiling systems can be obtained by the following construction rules: Draw a regular square grid n×n of n2 cells. Select a space-filling curve that is consistent with ...
1
vote
1answer
90 views

Is there a rectangular tiling based on the Padovan sequence? [closed]

I'm thinking of developing a rectangular tiling based on the Padovan sequence (think of the Fibonacci mosaic). It seems like something that should exist, but I can't find anything in the literature. ...
14
votes
1answer
552 views

Tiling rectangle with trominoes - an invariant

There are two types of trominoes, straight shapes and L-shaped. Suppose a rectangle $R$ admits at least one tiling using trominoes, with an even number of L-trominoes. EDIT: we do not admit ALL ...
1
vote
1answer
176 views

Looking for an efficient way of maximising 'pair scores' for subset of 30 selected from 50 to 10 000 objects

Context: I have a tiling program that uses a directed breadth first search algorithm. It is 'directed' by what I call 'pair scoring'. There are $N$ polyforms (pieces) used in the tiling. I have an $N\...
5
votes
3answers
338 views

Can local flip moves connect dimer matchings on 'quadrangulated' planar bipartite graphs? (perfect matching reconfiguration problem)

I'm interested in the structure of dimer matchings on planar graphs with a bipartite structure. In particular, I'm interested in whether any two perfect matchings can be connected, i.e. transformed ...
1
vote
0answers
165 views

Generalizations of classical tiling problem

A classic problem using an inductive construction is to show that the $2^n \times 2^n$-square, with a missing corner, can be tiled with L-triominoes. The proof goes like this: It is true for $n=1$, ...
3
votes
1answer
225 views

Triangling the triangle

Is it possible to tile an equilateral integer-sided triangle with smaller equilateral integer-sided triangles, with no congruent triangles touching? This has been answered in the negative for the case ...
2
votes
0answers
132 views

Tradeoffs in translation-invariant tilings of $\mathbb{R}^3$

Suppose I tile $\mathbb{R}^3$ in a ($\mathbb{Z}^3$-)translation-invariant manner. If we insist on the tiling being regular, then we are left with only the cubic tiling. However, suppose that we ...
3
votes
1answer
109 views

Does every locally compact connected homogeneous metric space admit a vertex-transitive 'grid'?

This is a followup to this easier version of this question on MSE, which Lee Mosher answered in the positive in the special case that $X$ is a hyperbolic space. It's also vaguely related to this ...
7
votes
1answer
229 views

Changing tiles by swapping squares

In an $n\times n$ table, initially there is a $1\times n$ tile in each row. A swap is an operation that involves choosing two tiles, move one square from the first to the second tile, and ...
3
votes
0answers
116 views

Aperiodic tile with rational area

Margulis and Mozes constructed aperiodic tiling system on the hyperbolic plane consisting of a single tile(hyperbolic polygon) whose area (or each inner angle) is irrational multiple of $\pi$. Having ...
12
votes
2answers
333 views

Random Walk on Pentagonal Tiling

I’ve recently been looking at closed walks on tilings of the plane in which the “player” can move from one tile to any of its edge-adjacent neighbors. In particular, I’m trying to find asymptotic ...
2
votes
0answers
91 views

Graphs determined by monohedral, edge-to-edge tilings of the plane

Let $\cal T$ be a monohedral, edge-to-edge tiling of the plane, with prototile $T$ a simple polygon, and with one edge $e^*$ of $T$ distinguished. Associate a graph $G=G_{\cal T}$ with $\cal T$ as ...
4
votes
0answers
54 views

Unbalanced colourings of Penrose tiles

It is known that both the rhombus and kite-and-dart Penrose tilings are three-colourable, from Babilon, Robert. "3-colourability of Penrose kite-and-dart tilings." Discrete Mathematics 235, no. 1-3 (...
5
votes
0answers
148 views

Tiling rectangles using all squares of sides 1, 2, 3, …, n

Do integers n greater than 2 exist such that all the squares of sides 1, 2, 3, ..., n can be partitioned into two or more sets (none a singleton) each of whose squares can be used to tile a rectangle?
11
votes
1answer
370 views

Growing a chain of unit-area triangles: Fills the plane?

Define a process to start with a unit-area equilateral triangle, and at each step glue on another unit-area triangle.                     $50$ ...
4
votes
1answer
127 views

Tiling the surface of a hypersphere with regular simplices

Let $S^{n-1} = \{x \in \mathbb{R}^n : x_1^2 + \cdots + x_n^2 = 1\}$. Consider a regular spherical simplex, obtained e.g. by taking a hyperspherical cap, picking $n$ equally-spaced points $P = \{p_1, \...
5
votes
0answers
90 views

Hooks, monomers, dimers and Young diagrams: Part II

As promised, I've upgraded my last question. Consider the $k$-by-$n$ partition $\lambda_n=(n,\dots,n)$ and its corresponding Young diagram $Y_{n,k}$, which is a $k\times n$ rectangle of cells. Now, ...
4
votes
0answers
136 views

Hooks, monomers, dimers and Young diagrams: Part I

Following Richard Stanley's pointers regarding my earlier MO question, I decided to "scale-down" the problem and add a slight "twist" to it. Consider the one-line partition $\lambda_n=(n)$ and its ...
5
votes
0answers
129 views

monomer-dimer tiling of a Young diagram

As a modest start, I propose the below problem for a special set of partitions. Perhaps it is known. Let $\lambda_n=(n,n-1,\dots,2,1)$ be the staircase partition and its corresponding Young diagram $...
6
votes
3answers
779 views

Tiling a square with rectangles whose areas or perimeters are 1, 2, 3, …, N

For which positive integers N does there exist a square that can be completely tiled with N rectangles of integer sides whose areas or perimeters are precisely 1, 2, 3, ..., N?
4
votes
0answers
138 views

Tiling squares with oblongs

An oblong is a rectangle whose width and length are consecutive integers: 1x2, 2x3, 3x4, etc. Does N exist such that it is possible to split the first N oblongs into 2 or more non-intersecting sets so ...
4
votes
0answers
141 views

Generating a Penrose tessellation around a given tile

Given a starting Penrose tile, I need to build a "spiraling" tessellation around it. The following picture illustrates the request: In this example, the starting tile is a "thin rhombus" (the pink ...
5
votes
0answers
99 views

What (if anything) is the connection between the Feit-Higman Theorem and the regular plane tilings?

Here are two facts that are superficially similar. Tiling Theorem: The only regular tilings of $\mathbb{R}^2$ are achieved by triangles, squares, and hexagons. Feit-Higman Theorem: The only finite ...
9
votes
1answer
323 views

Tiling with incommensurate triangles

Say that two triangles are incommensurate if they do not share an edge length or a vertex angle, and their areas differ. Suppose you'd like to tile the plane with pairwise incommensurate triangles. I ...
3
votes
0answers
89 views

chromatic number of plane using Cairo pentagonal tiling

Scale the Cairo pentagonal tiling so the short side is of length 1. Then it is easy to colour the tiling with 8 colours, two parallel ribbons of four colours each, to establish that the chromatic ...