## A Repeating Tessellation of Regular Polygons Which Lacks Vertex-Transitivity

I go by RobertLovesPi on-line, and am interested in many things, a large portion of which are geometrical. Welcome to my little slice of the Internet. The viewpoints and opinions expressed on this website are my own. They should not be confused with the views of my employer, nor any other organization, nor institution, of any kind.
Image | This entry was posted in Mathematics and tagged , , , . Bookmark the permalink.

### 2 Responses to A Repeating Tessellation of Regular Polygons Which Lacks Vertex-Transitivity

1. Tony Crisafi says:

Hi Robert,

what is a quasi tessellation? Have a look under education/magical wheel on my web site. Is my definition correct?

Thanks,

Tony

Like

• I can’t find the educational/magical wheel you mention, but the research I did to answer your question revealed to me that this is neither a semiregular tessellation, nor a quasiregular tessellation. To be quasiregular, each vertex needs to have just two types of polygon, alternating around each vertex, such as hexagon-triangle-hexagon-triangle. Semiregular could be, for example, hexagon-square-triangle-square. Both quasiregular and semiregular tessellations require vertex-transitivity (same arrangement around each vertex), which this doesn’t have. Thank you for bringing this to my attention; I’ll rename it to something more appropriate.

Like