This note characterizes monohedral tilings of regular polygons with up to three tiles.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
4 results for “monohedral”
problem Characterizing monohedral tilings of regular polygons with up to three tiles.
method Connecting the results for squares and circles to generalize for any regular -gon.
result Characterization of monohedral tilings of any regular -gon with up to three tiles.
The study proves that in normal tilings, at least two vertices are required per cell.
problem Understanding the minimum number of vertices required in normal tilings.
method The research examines both periodic and monohedral tilings in 2D, proving the minimum number of non-smooth vertices required.
result The study confirms that for normal tilings, at least two vertices are necessary per cell.
In this note we prove that any monohedral tiling of the closed circular unit disc with topological discs as tiles has a -fold rotational symmetry. This result yields the first nontrivial estimate about the minimum number of tiles in a monohedral tiling of the circular disc in which not all tiles contain t…
Tileable Surfacesmath.DG
Constructs surfaces that can be tiled by a finite set of rigid motion congruence classes of tiles.
problem Creating surfaces that can be tiled by a finite set of rigid motion congruence classes of tiles.
method Constructs examples with various topologies and describes all monotilings by finite edge prototiles.
result Describes all monotilings by finite edge prototiles with three or less edges.