On symmetric words in the symmetric group of degree three

Authors

  • Ernest Plonka

DOI:

https://doi.org/10.7146/math.scand.a-14997

Abstract

A word w(x1,x2,,xn) from absolutely free group Fn is called symmetric n-word in a group G, if the equality w(g1,g2,,gn)=w(gσ1,gσ2,,gσn) holds for all g1,g2,,gnG and all permutations σSn. The set S(n)(G) of all symmetric n-words is a subgroup of Fn. In this paper the groups of all symmetric 2-words and 3-words for the symmetric group of degree 3 are determined.

Downloads

Published

2006-09-01

How to Cite

Plonka, E. (2006). On symmetric words in the symmetric group of degree three. MATHEMATICA SCANDINAVICA, 99(1), 5–16. https://doi.org/10.7146/math.scand.a-14997

Issue

Section

Articles