Families of irreptiles (Q835324)

A polygon \(A\) is called a reptile if it can be dissected into finitely many pairwise congruent pieces which are similar images of \(A\). In the case when these copies of \(A\) are not necessarily pairwise congruent, \(A\) is called an irreptile. The paper brings several rather large classes of irreptiles -- an uncountable family based on isosceles triangles, a countable family of polyiamonds, a countable family based on isosceles right triangles, an uncountable family related to rhombs, a countable family of non-lattice pentagons and an uncountable family of trapezoids. In the paper there are found a large variety of shapes, where minimality of number of pieces is not demanded.