Related papers: Tiling of regular polygons with similar right tria…
The periodic tiling conjecture (PTC) asserts, for a finitely generated Abelian group $G$ and a finite subset $F$ of $G$, that if there is a set $A$ that solves the tiling equation $\mathbb{1}_F * \mathbb{1}_A = 1$, there is also a periodic…
Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…
We introduce and study the number of tilings of unit height rectangles with irrational tiles. We prove that the class of sequences of these numbers coincides with the class of diagonals of N-rational generating functions and a class of…
A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…
In this paper, we show that for a fixed rank $n$, there are only finitely many $m$ for which there is a regular $m$-gonal form of rank $n$ and determine every type of the (generalized) regular $m$-gonal form for every sufficiently large…
We show that a rectangle can be signed tiled by ribbon L n-ominoes, n odd, if and only if it has a side divisible by n. A consequence of our technique, based on the exhibition of an explicit Groebner basis, is that any k-inflated copy of…
Given a graph $G$ and collection of subgraphs $T$ (called tiles), we consider covering $G$ with copies of tiles in $T$ so that each vertex $v\in G$ is covered with a predetermined multiplicity. The multinomial tiling model is a natural…
Let K_4^3-2e denote the hypergraph consisting of two triples on four points. For an integer n, let t(n, K_4^3-2e) denote the smallest integer d so that every 3-uniform hypergraph G of order n with minimum pair-degree \delta_2(G) \geq d…
A regular $n$-gon inscribing a knot is a sequence of $n$ points on a knot, such that the distances between adjacent points are all the same. It is shown that any smooth knot is inscribed by a regular $n$-gon for any $n$.
We consider tilings of deficient rectangles by the set $\mathcal{T}_4$ of ribbon $L$-tetrominoes. A tiling exists iff the rectangle is a square of odd side. The missing cell is on the main NW--SE diagonal, in an odd position if the square…
In this paper we give a complete description about normal monohedral tilings of a convex disc with smooth boundary where we have at most three topological discs as tiles. This result is a far-reaching generalization of the results of…
This paper contains a method to prove the existence of smooth curves in positive characteristic whose Jacobians have unusual Newton polygon. Using this method, I give a new proof that there exist supersingular curves of genus $4$ for every…
The tilings of the 2-dimensional sphere by congruent triangles have been extensively studied, and the edge-to-edge tilings have been completely classified. However, not much is known about the tilings by other congruent polygons. In this…
A universal tiler is a convex polyhedron whose every cross-section tiles the plane. In this paper, we introduce a certain slight-rotating operation for cross-sections of pentahedra. Based on a selected initial cross-section and by applying…
In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…
The paper provides an elementary proof of Kenyon's necessary condition for the existence of a periodic tiling of the plane by squares with given periods. A similar new result on covering both sides of a rectangle by nonoverlaping squares is…
Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture…
We provide a list of conjectured surface-area-minimizing n-hedral tiles of space for n from 4 to 14, previously known only for n equal to 5 or 6. We find the optimal "orientation-preserving" tetrahedral tile (n=4), and we give a nice proof…
The paper establishes that the rank of a regular polygonal complex in 3-space E^3 cannot exceed 4, and that the only regular polygonal complexes of rank 4 in 3-space are the eight regular 4-apeirotopes.
We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cyclic order, the algorithm runs in linear time and constant…