Skip to main content
edited tags
Link
domotorp
  • 19k
  • 3
  • 58
  • 127
added 14 characters in body
Source Link
Boris Novikov
  • 3.1k
  • 1
  • 16
  • 17

I'm working on some palindromic words right now. Those are the elements of F_2$F_2$, the free group on two generators, which are the same if reveresed. For example $xyx, y^2, xyxxyx$ and so on.

Can you write each element of F'$F'$, the derived group, as a product of palindromes of EVEN length? Does this property hold if you are not in F$F$, but in a group G$G$ in which you know that every element is a product of at most n$n$ palindromes? If G$G$ has this property then G$G$ has finite palindromic width.

I've puzzled around quite a bit but can't find a way of even writing $x^{-1}y^{-1}xy$ as a product of palindromes of even length.

Thanks, Elisabeth

I'm working on some palindromic words right now. Those are the elements of F_2, the free group on two generators, which are the same if reveresed. For example $xyx, y^2, xyxxyx$ and so on.

Can you write each element of F', the derived group, as a product of palindromes of EVEN length? Does this property hold if you are not in F, but in a group G in which you know that every element is a product of at most n palindromes? If G has this property then G has finite palindromic width.

I've puzzled around quite a bit but can't find a way of even writing $x^{-1}y^{-1}xy$ as a product of palindromes of even length.

Thanks, Elisabeth

I'm working on some palindromic words right now. Those are the elements of $F_2$, the free group on two generators, which are the same if reveresed. For example $xyx, y^2, xyxxyx$ and so on.

Can you write each element of $F'$, the derived group, as a product of palindromes of EVEN length? Does this property hold if you are not in $F$, but in a group $G$ in which you know that every element is a product of at most $n$ palindromes? If $G$ has this property then $G$ has finite palindromic width.

I've puzzled around quite a bit but can't find a way of even writing $x^{-1}y^{-1}xy$ as a product of palindromes of even length.

Thanks, Elisabeth

Source Link

$\left[x,y\right]$ as a product of palindromes of even length?

I'm working on some palindromic words right now. Those are the elements of F_2, the free group on two generators, which are the same if reveresed. For example $xyx, y^2, xyxxyx$ and so on.

Can you write each element of F', the derived group, as a product of palindromes of EVEN length? Does this property hold if you are not in F, but in a group G in which you know that every element is a product of at most n palindromes? If G has this property then G has finite palindromic width.

I've puzzled around quite a bit but can't find a way of even writing $x^{-1}y^{-1}xy$ as a product of palindromes of even length.

Thanks, Elisabeth