
doi: 10.37236/1327
Given a list $1\times 1, 1\times a, 1\times b, \dots, 1\times c$ of rectangles, with $a,b,\dots,c$ non-negative, when can $1\times{t}$ be tiled by positive and negative copies of rectangles which are similar (uniform scaling) to those in the list? We prove that such a tiling exists iff $t$ is in the field $Q(a,b,\dots,c)$.
Combinatorial aspects of tessellation and tiling problems, General field theory, Polyominoes, Tilings in \(2\) dimensions (aspects of discrete geometry), Length, area and volume in real or complex geometry
Combinatorial aspects of tessellation and tiling problems, General field theory, Polyominoes, Tilings in \(2\) dimensions (aspects of discrete geometry), Length, area and volume in real or complex geometry
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
