class_docstr: References
  ==========
  
  .. [1] Holt, D., Eick, B., O'Brien, E.
         "Handbook of Computational Group Theory"
         Section 8.1.3
class_docstr_tok: ["References","==========","..","[","1","]","Holt",",","D.",",","Eick",",","B.",",","O'Brien",",","E.","``","Handbook","of","Computational","Group","Theory","''","Section","8.1.3"]
docstr: Return a conjugate relation.
  
  Explanation
  ===========
  
  Given a word formed by two free group elements, the
  corresponding conjugate relation with those free
  group elements is formed and mapped with the collected
  word in the polycyclic presentation.
  
  Examples
  ========
  
  >>> from sympy.combinatorics.named_groups import SymmetricGroup
  >>> from sympy.combinatorics import free_group
  >>> G = SymmetricGroup(3)
  >>> PcGroup = G.polycyclic_group()
  >>> collector = PcGroup.collector
  >>> F, x0, x1 = free_group("x0, x1")
  >>> w = x1*x0
  >>> collector.map_relation(w)
  x1**2
  
  See Also
  ========
  
  pc_presentation
docstr_tok: ["Return","a","conjugate","relation",".","Explanation","===========","Given","a","word","formed","by","two","free","group","elements",",","the","corresponding","conjugate","relation","with","those","free","group","elements","is","formed","and","mapped","with","the","collected","word","in","the","polycyclic","presentation",".","Examples","========",">",">",">","from","sympy.combinatorics.named_groups","import","SymmetricGroup",">",">",">","from","sympy.combinatorics","import","free_group",">",">",">","G","=","SymmetricGroup","(","3",")",">",">",">","PcGroup","=","G.polycyclic_group","(",")",">",">",">","collector","=","PcGroup.collector",">",">",">","F",",","x0",",","x1","=","free_group","(","``","x0",",","x1","''",")",">",">",">","w","=","x1","*","x0",">",">",">","collector.map_relation","(","w",")","x1","*","*","2","See","Also","========","pc_presentation"]
code: def map_relation(self, w):
      """
      Return a conjugate relation.
  
      Explanation
      ===========
  
      Given a word formed by two free group elements, the
      corresponding conjugate relation with those free
      group elements is formed and mapped with the collected
      word in the polycyclic presentation.
  
      Examples
      ========
  
      >>> from sympy.combinatorics.named_groups import SymmetricGroup
      >>> from sympy.combinatorics import free_group
      >>> G = SymmetricGroup(3)
      >>> PcGroup = G.polycyclic_group()
      >>> collector = PcGroup.collector
      >>> F, x0, x1 = free_group("x0, x1")
      >>> w = x1*x0
      >>> collector.map_relation(w)
      x1**2
  
      See Also
      ========
  
      pc_presentation
  
      """
      array = w.array_form
      s1 = array[0][0]
      s2 = array[1][0]
      key = ((s2, -1), (s1, 1), (s2, 1))
      key = self.free_group.dtype(key)
      return self.pc_presentation[key]
  
imports: from sympy.ntheory.primetest import isprime
  from sympy.combinatorics.perm_groups import PermutationGroup
  from sympy.printing.defaults import DefaultPrinting
  from sympy.combinatorics.free_groups import free_group
label_desc: Use image node_id 5 for calling the Collector obj's underlying member method code with example usage: obj.map_relation(w) and returns: self