[Group Theory] Constructing Cayley Graph from Given Relations

In summary, the conversation discusses how to construct a group of order 21 with two generators s and t, where s^3 = I and sts^{-1} = t^2. The solution involves constructing a graph based on either 3 heptagons or 7 triangles. The conversation also mentions the need for concentric heptagons and the challenge of properly connecting the vertices to satisfy the given relations. The key to solving the problem is understanding that it does not matter which two vertices are connected first, as the rest can be derived from there.
  • #1
esorey
3
0

Homework Statement


Show that there exists a group of order 21 having two generators [itex]s[/itex] and [itex]t[/itex] for which [itex]s^3 = I[/itex] and [itex]sts^{-1} = t^2[/itex]. Do this exercise by constructing the graph of the group.

Homework Equations


Based on the given relations, we have [itex]t^7 = I[/itex].

The Attempt at a Solution


Since ##s## and ##t## have periods of 3 and 7, respectively, I know that the graph can be based on either 3 heptagons or 7 triangles. The back of the book has a solution based on 7 triangles, but I would like to construct a graph based on heptagons for some much-needed practice. I see that I need three concentric heptagons to give the 21 elements of the group. However, I am having a hard time understanding how to connect the vertices of the heptagons to satisfy [itex]sts^{-1} = t^2[/itex]. I have had similar issues with the graphs of simpler groups which I solved by brute force. However, this group is complex enough that I do not want to do that. Is there some algorithmic way of seeing how the vertices must be connected by [itex]s[/itex]? If not, how do I go about figuring out the proper configuration?

Thanks
 
Last edited:
Physics news on Phys.org
  • #2
You know that s has to connect a vertex of one heptagon to a vertex in a different heptagon. For sts-1 = t2 to hold, then going from one heptagon to the next, taking a step around in the t direction, then coming back to the first heptagon is the same as taking two steps around the original heptagon.
 
  • #3
I figured it out! For some reason, I didn't realize that it didn't matter which two vertices you connect first, since from there you derive the rest. Thanks!
 

FAQ: [Group Theory] Constructing Cayley Graph from Given Relations

What is group theory?

Group theory is a branch of mathematics that deals with the study of groups, which are mathematical objects that exhibit symmetry. It is an important tool in many areas of mathematics, including algebra, geometry, and topology.

What is a Cayley graph?

A Cayley graph is a visual representation of a group, where each element of the group is represented by a vertex and the group operations are represented by edges connecting the vertices. It is a useful tool in understanding the structure and properties of groups.

How do you construct a Cayley graph from given relations?

To construct a Cayley graph from given relations, you first need to determine the generators of the group and the relations among them. Then, each element of the group is represented by a vertex and the generators are represented by the edges connecting the vertices. The given relations dictate how the edges are connected, and the resulting graph is the Cayley graph of the group.

What are the applications of Cayley graphs?

Cayley graphs have various applications in different fields, such as in cryptography, computer science, and chemistry. They are also used in the study of groups and their properties, as well as in understanding the symmetries of geometric objects.

Can Cayley graphs be used to solve problems in group theory?

Yes, Cayley graphs can be a helpful tool in solving problems in group theory. They provide a visual representation of a group, which can aid in understanding its structure and properties. They can also be used to generate new group elements and to explore relationships between different elements of a group.

Similar threads

Back
Top