Related papers: General polygonal line tilings and their matching …

Aperiodic tilings support two classically studied but hitherto separately presented structures: matching rules, which enforce global order via local constraints, and height functions, which encode global geometry through integer-valued…

There are exactly eight edge-to-edge tilings of the sphere by congruent equilateral pentagons: three pentagonal subdivision tilings with 12, 24, 60 tiles; four earth map tilings with 16, 20, 24, 24 tiles; and one flip modification of the…

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$…

Generalized cycles can be thought of as the extension of form-cycle duality between holomorphic forms and cycles, to meromorphic forms and generalized cycles. They appeared as an ubiquitous tool in the study of spectral curves and…

Given a planar straight-line graph $G=(V,E)$ in $\mathbb{R}^2$, a \emph{circumscribing polygon} of $G$ is a simple polygon $P$ whose vertex set is $V$, and every edge in $E$ is either an edge or an internal diagonal of $P$. A circumscribing…

The vertex corona of a vertex of some tiling is the vertex together with the adjacent tiles. A tiling where all vertex coronae are congruent is called monocoronal. We provide a classification of monocoronal tilings in the Euclidean plane…

A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…

The homology group of a tiling introduced by M. Reid is studied for certain topological tilings. As in the planar case, for finite square grids on topological surfaces, the method of homology groups, namely the non-triviality of some…

We present sweeping line graphs, a generalization of $\Theta$-graphs. We show that these graphs are spanners of the complete graph, as well as of the visibility graph when line segment constraints or polygonal obstacles are considered. Our…

Suppose $\Omega, A \subseteq \RR\setminus\Set{0}$ are two sets, both of mixed sign, that $\Omega$ is Lebesgue measurable and $A$ is a discrete set. We study the problem of when $A \cdot \Omega$ is a (multiplicative) tiling of the real line,…

Generalized splines are an algebraic combinatorial framework that generalizes and unifies various established concepts across different fields, most notably the classical notion of splines and the topological notion of GKM theory. The…

We apply Diophantine analysis to classify edge-to-edge tilings of the sphere by congruent almost equilateral quadrilaterals (i.e., edge combination a3b). Parallel to a complete classification by Cheung, Luk and Yan, the method implemented…

We consider a class of cut-and-project sets $\Lambda = \Lambda_F \times \zahl$ in the plane. Let $L=\Lambda+w\real$, $w\in\real^2$, be a countable union of parallel lines. Then either (1) $L$ is a discrete family of lines, (2) $L$ is a…

In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…

We introduce a class of graphs called compound graphs, generalizing rectangles, which are constructed out of copies of a planar bipartite base graph. The main result is that the number of perfect matchings of every compound graph is…

We consider tilings of the plane with 12-fold symmetry obtained by the cut and projection method. We compute their cohomology groups using the techniques introduced by the second author, Hunton and Kellendonk. To do this we completely…

In the perfect tiling problem, we aim to cover the vertices of a hypergraph~$G$ with pairwise vertex-disjoint copies of a hypergraph $F$. There are three essentially necessary conditions for such a perfect tiling, which correspond to…

The clique complex of a graph G is a simplicial complex whose simplices are all the cliques of G, and the line graph L(G) of G is a graph whose vertices are the edges of G and the edges of L(G) are incident edges of G. In this article, we…

Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In the present paper we highlight their connections to the Kuramoto synchronization model in physics -- where they are called adjacency…

There are fifteen edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^3b^2$: five one-parameter families of pentagonal subdivision tilings, and ten flip modifications of three special cases of two…