2000 character limit reached
On Commutation Semigroups of Dihedral Groups
Published 9 Oct 2012 in math.RA | (1210.2568v2)
Abstract: For G a group and g in G, we define mappings pg(G) and lg(G) from G into G by pg(x)=[x,g] and lg(x)=[g,x]. We let P(G) and L(G) denote the subsemigroups of the set of all mappings from G to G generated by {pg: g in G} and {lg: g in G}, respectively. P(G) and L(G) are called the right and left commutation semigroup of G, respectively. In this paper we will give explicit formulas for the orders of both P(G) and L(G) where G is a dihedral group.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.