Self-affine convex polygons (Q622549): Difference between revisions

Two plane figures are equivalent via an affine transformation if one can be mapped bijectively onto the other using an invertible linear transformation and a translation. The paper investigates the problem of classifying convex polygons in \(\mathbb{R}^2\) which can be dissected into 2 or more pieces each of which is equivalent to the original polygon via an affine transformation. Such polygons are called self-affine. It is remarked that every triangle is self-affine. It is proven that every convex quadrangle is self-affine and provided that this quadrangle is not a parallelogram, any polygon can be tiled by finitely many affine images of it. It is shown that the regular pentagon is not self-affine. An example of a self-affine convex pentagon is presented.