This question is related to [this one](https://mathoverflow.net/questions/102933/reconstructing-a-word) but for some reason I did not see a connection before Ben McReynolds asked me that question. 


 **Question**  What is the smallest function $f(n)$ such that for every two non-conjugate words $u,v$ from the free group $F\_2$ of length $\le n$ there exists a finite homomorphic image of $F\_2$ of order $\le f(n)$ where $u,v$ are not conjugate?


The function $f(n)$ can be called the conjugacy depth function of $F\_2$. The ordinary depth function intruduced by Bou-Rabee "serves" the word problem in a similar way. It is known and not difficult to deduce from the fact that $F\_2$ is linear that the depth function of the free group is polynomial (the best known estimate is due to Kassabov and Matucci). Is the conjugacy depth function of the free group bound by a polynomial? It would be so if the answer to the [that question](https://mathoverflow.net/questions/102933/reconstructing-a-word) is "yes" because matrices with different traces are not conjugate and if two matrices in $SL\_3(Z[x\_{11},...,y\_{33}])$ have different traces, then these two matrices will have different traces in some small finite factor. As Ben McReynolds pointed out to me, if one uses nilpotent factors of $F\_2$ to estimate the conjugacy depth growth,one gets exponential estimates. 


 **Update.**  One does not need work of Marshall Hall, Hempel, Stallings or Stebe to prove conjugacy separability of $F\_2$. One does not need linear groups as well. Here is a proof. Let $u,v$ be cyclically reduced words in $F\_2$, $u$ is not a cyclic shift of $v$, $n=|v|\ge |u|$. Consider a finite 4-regular graph $(V,E)$ containing exactly one cycle $C$ of length $n$ (exercise: construct such a graph). Label the edges of $C$ by the generators of $F\_2$ and their inverses so that $C$ spells $v$. Extend the labeling of $C$ to a lebeling of $(V,E)$ by the generators of $F\_2$ and their inverses to obtain a complete automaton (no two edges having the same tail have the same label). Then each generator of $F\_2$ induces a permutation of $V$. So the labeling induces a homomorphism of $F\_2$ into the symmetric group $S\_{V}$. The images of $u$ and $v$ under this homomorphism are not conjugate because the image of $v$ has a fixed point while the image of $u$ has not. 



Conjugacy depth of free groups
The question, as far as I know, is open. Sean Lawton, Lars Louder, and I are just finishing up a paper that addresses the complexity of the depth function for conjugacy separability. At present, we can prove that if you fix a word in the free group, then distinguishing the associated conjugacy class from another conjugacy class in finite quotients is polynomial in the word length of the varying class. The degree of the polynomial depends on the fixed word. We give two algorithms. One is geometric and one is algebraic.


We tie the complexity of this function with linear representations of groups as Mark mentioned above. The case of n=3 is not special and having any linear representation of the free group that sends conjugacy classes to distinct traces suffices for a polynomial upper bound. I hesitate to say too much as to where I lean but I would guess that the complexity of the depth function for conjugacy in free groups is super-polynomial. We provide a decent amount of evidence for this in the forthcoming paper. 


We also prove that for groups like SL(n,Z), which are known by work of Stebe to not be conjugacy separable for n at least 3, have a rather dramatic failure of conjugacy separability. Essentially every infinite word will have infinitely many powers that are conjugate to other words that are not conjugate to the power in SL(n,Z). These other words are also primitive (not powers of another word). This investigation also leads to a general method for addressing the depth function for conjugacy on free groups. 


With one of my students, Mark Pengitore, we are currently writing a paper on these conjugacy depth functions for other classes of groups; virtually polycyclic for instance. 


