Related papers: Combinatorial Space Tiling
This paper is intended to provide an introduction to the theory of substitution tilings. For our purposes, tiling substitution rules are divided into two broad classes: geometric and combinatorial. Geometric substitution tilings include…
The purpose of this thesis is to study classical combinatorial objects, such as polytopes, polytopal complexes, and subspace arrangements, using tools that have been developed in combinatorial topology, especially those tools developed in…
A locally finite face-to-face tiling of euclidean d-space by convex polytopes is called combinatorially multihedral if its combinatorial automorphism group has only finitely many orbits on the tiles. The paper describes a local…
A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…
Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular…
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…
The purpose of this paper is to give the flavor of the subject of self-similar tilings in a relatively elementary setting, and to provide a novel method for the construction of such polygonal tilings.
We study the space of all tilings which can be obtained using the Robinson tiles (this is a two-dimensional subshift of finite type). We prove that it has a unique minimal subshift, and describe it by means of a substitution. This…
We describe a method to classify crystallographic tilings of the Euclidean and hyperbolic planes by tiles whose stabiliser group contains translation isometries or whose topology is not that of a closed disk. We tackle this problem from two…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
We introduce a new general framework for constructing tilings of Euclidean space, which we call multiscale substitution tilings. These tilings are generated by substitution schemes on a finite set of prototiles, in which multiple distinct…
Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…
Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…
We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…
This note contains a solution to the following problem: reconstruct the definition field and the equation of a projective cubic surface, using only combinatorial information about the set of its rational points. This information is encoded…
This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including…
We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…
We determine the topology of the moduli space of periodic tilings of the plane by parallelograms. To each such tiling, we associate combinatorial data via the zone curves of the tiling. We show that all tilings with the same combinatorial…
Starting from the (apparently) elementary problem of deciding how many different topological spaces can be obtained by gluing together in pairs the faces of an octahedron, we will describe the central role played by hyperbolic geometry…
This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with…