Conjugacy problem

In abstract algebra, the conjugacy problem for a group G with a given presentation is the decision problem of determining, given two words x and y in G, whether or not they represent conjugate elements of G. That is, the problem is to determine whether there exists an element z of G such that y = z x z − 1 . {\displaystyle y=zxz^{-1}.\,\! } The conjugacy problem is also known as the transformation problem.

Source: Wikipedia — Conjugacy problem (CC BY-SA 4.0)

Conjugacy problem

In abstract algebra, the conjugacy problem for a group G with a given presentation is the decision problem of determining, given two words x and y in G, whether or not they represent conjugate elements of G. That is, the problem is to determine whether there exists an element z of G such that y = z x z − 1 . {\displaystyle y=zxz^{-1}.\,\! } The conjugacy problem is also known as the transformation problem.

This neuron ends here.

Source: Wikipedia "Conjugacy problem" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy