We give a complete solution to the extremal topological combinatorial problem of finding the minimum number of tiles needed to construct a polyomino with holes. We denote this number by and say that a polyomino is crystallized if it has holes and tiles. We analyze structural properties of crystall…
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
5 results for “polyominoes”
Researchers found the maximum number of holes in polyominoes grows proportionally to the dimension.
problem Finding the maximum number of holes in polyominoes of varying dimensions.
method Used concepts from error-correcting codes and dynamical systems.
result Proved that as goes to infinity for all .
The study of tiling homology on flat surfaces, proving impossibility of certain tilings.
problem Proving the non-existence of polyomino tilings on specific square-tiled surfaces.
method Study of homology groups for topological tilings, using coloring proofs.
result Several results about the non-existence of polyomino tilings on certain square-tiled surfaces.
Venn diagrams are a graphical way to represent a set system. Each of the n sets is represented by a simple closed curve. The n curves subdivide the plane into 2^n open connected regions, each of which represents the intersection of its containing curves' sets. For example, two overlapping circles can divide the plane i…
No free lunch theorem formalized for tensor network models.
problem Understanding limitations of tensor network machine learning models.
method Formalized rigorous no-free-lunch theorem for specific tensor network models.
result Revealed intrinsic limitations of tensor network-based learning models.