15 added 6 characters in body
source | link

enter image description here

The figure shows a hexagon and triangle tiled by six tiles, which are pairwise congruent.

My question is:

What is the smallest number of polygonal tiles that will tile both a regular hexagon and an equilateral triangle in such a way that all the edges of the tiles are parallel to an edge of the tiled figure?

Small print:

  • I define a polygonal tile as a figure comprised of:

    A finite set $P$ of at least three points.

    The (straight) lines $X\pi(X)$ for each point $X\in P$ and some cyclic permutation $\pi$ of $P$ such that distinct lines do not intersect except at mutual end points.

    The region contained by the lines.

  • The hexagon, triangle and tiles are assumed to include the vertices, edges and interior.

  • The figures tiled must be the union of exactly one congruent copy of each tile (though the set of tiles itself is allowed to contain congruent figures). No copy of a tile can share an interior point with the copy of any other tile, but may share boundary points with one or more.

  • A congruent copy of a tile may be a "flipped" version (e.g. the pair of cyan tiles in the above diagram are actually mirror images of each other - this is allowed).

enter image description here

The figure shows a hexagon and triangle tiled by six tiles, which are pairwise congruent.

My question is:

What is the smallest number of polygonal tiles that will tile both a regular hexagon and an equilateral triangle in such a way that all the edges of the tiles are parallel to an edge of the tiled figure?

Small print:

  • I define a polygonal tile as a figure comprised of:

    A finite set $P$ of at least three points.

    The (straight) lines $X\pi(X)$ for each point $X\in P$ and some cyclic permutation $\pi$ of $P$ such that distinct lines do not intersect except at mutual end points.

    The region contained by the lines.

  • The hexagon, triangle and tiles are assumed to include the vertices, edges and interior.

  • The figures tiled must be the union of exactly one congruent copy of each tile (though the set of tiles itself is allowed to contain congruent figures). No copy of a tile can share an interior point with the copy of any other tile, but may share boundary points with one or more.

  • A congruent copy of a tile may be a "flipped" version (e.g. the pair of cyan tiles in the above diagram are actually mirror images - this is allowed).

enter image description here

The figure shows a hexagon and triangle tiled by six tiles, which are pairwise congruent.

My question is:

What is the smallest number of polygonal tiles that will tile both a regular hexagon and an equilateral triangle in such a way that all the edges of the tiles are parallel to an edge of the tiled figure?

Small print:

  • I define a polygonal tile as a figure comprised of:

    A finite set $P$ of at least three points.

    The (straight) lines $X\pi(X)$ for each point $X\in P$ and some cyclic permutation $\pi$ of $P$ such that distinct lines do not intersect except at mutual end points.

    The region contained by the lines.

  • The hexagon, triangle and tiles are assumed to include the vertices, edges and interior.

  • The figures tiled must be the union of exactly one congruent copy of each tile (though the set of tiles itself is allowed to contain congruent figures). No copy of a tile can share an interior point with the copy of any other tile, but may share boundary points with one or more.

  • A congruent copy of a tile may be a "flipped" version (e.g. the cyan tiles in the above diagram are actually mirror images of each other - this is allowed).

14 added 1 character in body
source | link

enter image description here

The figure shows a hexagon and triangle tiled by six tiles, which are pairwise congruent.

My question is:

What is the smallest number of polygonal tiles that will tile both a regular hexagon and an equilateral triangle in such a way that all the edges of the tiles are parallel to an edge of the tiled figure?

Small print:

  • I define a polygonal tile as a figure comprised of:

    A finite set $P$ of at least three points.

    The (straight) lines $X\pi(X)$ for each point $X\in P$ and some cyclic permutation $\pi$ of $P$ such that distinct lines do not intersect except at mutual end points.

    The region contained by the lines.

  • The hexagon, triangle and tiles are assumed to include the vertices, edges and interior.

  • The figures tiled must be the union of exactly one congruent copy of each tile (though the set of tiles itself is allowed to contain congruent figures). No copy of a tile can share an interior point with the copy of any other tile, but may share boundary points with one or more.

  • A congruent copy of a tile may be a "flipped" version (e.g. the pair of cyan tiles in the above digramdiagram are actually mirror images - this is allowed).

enter image description here

The figure shows a hexagon and triangle tiled by six tiles, which are pairwise congruent.

My question is:

What is the smallest number of polygonal tiles that will tile both a regular hexagon and an equilateral triangle in such a way that all the edges of the tiles are parallel to an edge of the tiled figure?

Small print:

  • I define a polygonal tile as a figure comprised of:

    A finite set $P$ of at least three points.

    The (straight) lines $X\pi(X)$ for each point $X\in P$ and some cyclic permutation $\pi$ of $P$ such that distinct lines do not intersect except at mutual end points.

    The region contained by the lines.

  • The hexagon, triangle and tiles are assumed to include the vertices, edges and interior.

  • The figures tiled must be the union of exactly one congruent copy of each tile (though the set of tiles itself is allowed to contain congruent figures). No copy of a tile can share an interior point with the copy of any other tile, but may share boundary points with one or more.

  • A congruent copy of a tile may be a "flipped" version (e.g. the cyan tiles in the above digram are actually mirror images - this is allowed).

enter image description here

The figure shows a hexagon and triangle tiled by six tiles, which are pairwise congruent.

My question is:

What is the smallest number of polygonal tiles that will tile both a regular hexagon and an equilateral triangle in such a way that all the edges of the tiles are parallel to an edge of the tiled figure?

Small print:

  • I define a polygonal tile as a figure comprised of:

    A finite set $P$ of at least three points.

    The (straight) lines $X\pi(X)$ for each point $X\in P$ and some cyclic permutation $\pi$ of $P$ such that distinct lines do not intersect except at mutual end points.

    The region contained by the lines.

  • The hexagon, triangle and tiles are assumed to include the vertices, edges and interior.

  • The figures tiled must be the union of exactly one congruent copy of each tile (though the set of tiles itself is allowed to contain congruent figures). No copy of a tile can share an interior point with the copy of any other tile, but may share boundary points with one or more.

  • A congruent copy of a tile may be a "flipped" version (e.g. the pair of cyan tiles in the above diagram are actually mirror images - this is allowed).

13 deleted 8 characters in body
source | link

enter image description here

The figure shows a hexagon and triangle tiled by six tiles, which are pairwise congruent.

My question is:

What is the smallest number of polygonal tiles that will tile both a regular hexagon and an equilateral triangle in such a way that all the edges of the tiles are parallel to an edge of the tiled figure?

Small print:

  • I define a polygonal tile as a figure comprised of:

    A finite set $P$ of at least three points.

    The (straight) lines $X\pi(X)$ for each point $X\in P$ and some cyclic permutation $\pi$ of $P$ such that distinct lines do not intersect except at mutual end points.

    The region contained by the lines.

  • The hexagon, triangle and tiles are assumed to include the vertices, edges and interior.

  • The figures tiled must be the union of exactly one congruent copy of each tile (though the set of tiles itself is allowed to contain congruent figures). No copy of a tile can share an interior point with the copy of any other tile, but may share boundary points with one or more.

  • A congruent copy of a tile may be a "flipped" version (e.g. the pair of cyan tiles in the above digram are actually mirror images - this is allowed).

enter image description here

The figure shows a hexagon and triangle tiled by six tiles, which are pairwise congruent.

My question is:

What is the smallest number of polygonal tiles that will tile both a regular hexagon and an equilateral triangle in such a way that all the edges of the tiles are parallel to an edge of the tiled figure?

Small print:

  • I define a polygonal tile as a figure comprised of:

    A finite set $P$ of at least three points.

    The (straight) lines $X\pi(X)$ for each point $X\in P$ and some cyclic permutation $\pi$ of $P$ such that distinct lines do not intersect except at mutual end points.

    The region contained by the lines.

  • The hexagon, triangle and tiles are assumed to include the vertices, edges and interior.

  • The figures tiled must be the union of exactly one congruent copy of each tile (though the set of tiles itself is allowed to contain congruent figures). No copy of a tile can share an interior point with the copy of any other tile, but may share boundary points with one or more.

  • A congruent copy of a tile may be a "flipped" version (e.g. the pair of cyan tiles in the above digram are actually mirror images - this is allowed).

enter image description here

The figure shows a hexagon and triangle tiled by six tiles, which are pairwise congruent.

My question is:

What is the smallest number of polygonal tiles that will tile both a regular hexagon and an equilateral triangle in such a way that all the edges of the tiles are parallel to an edge of the tiled figure?

Small print:

  • I define a polygonal tile as a figure comprised of:

    A finite set $P$ of at least three points.

    The (straight) lines $X\pi(X)$ for each point $X\in P$ and some cyclic permutation $\pi$ of $P$ such that distinct lines do not intersect except at mutual end points.

    The region contained by the lines.

  • The hexagon, triangle and tiles are assumed to include the vertices, edges and interior.

  • The figures tiled must be the union of exactly one congruent copy of each tile (though the set of tiles itself is allowed to contain congruent figures). No copy of a tile can share an interior point with the copy of any other tile, but may share boundary points with one or more.

  • A congruent copy of a tile may be a "flipped" version (e.g. the cyan tiles in the above digram are actually mirror images - this is allowed).

12 added 7 characters in body
source | link
11 deleted 33 characters in body
source | link
10 Minor odification of small print for clarity.
source | link
9 added 7 characters in body
source | link
8 Corrected definition of polygonal tile in "small print". My apologies to anyone working with the original
source | link
7 edited tags
| link
6 edited tags
| link
5 edited body
source | link
4 The tiles are not identical.
source | link
3 The tiles are not identical.
source | link
2 added 762 characters in body
source | link
1
source | link