Example: bachelor of science

DIHEDRAL GROUPS Introduction - University of Connecticut

ection across the line connecting each vertex to the midpoint of the opposite side. This is a total of nre ections (one per vertex). They are di erent because each one xes a di erent vertex. For even n, there is a re ection across the line connecting each pair of opposite vertices (n=2 re ections) and across the line connecting midpoints of ...

Tags:

  Vertex, Dihedral

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Transcription of DIHEDRAL GROUPS Introduction - University of Connecticut

Related search queries