Roth's Theorem states that any subset $A$ of $\{1, \dots, n\}$ with no solution to the equation $$x + y = 2z,\, (x, y, z) \in A^3,\, x \neq y$$ has size $o(n)$. Similar results hold when dealing with the same question in, for instance, $\mathbb{Z}/n\mathbb{Z}$.


I was wondering if similar questions have been studied in the context of non-abelian groups. 


A more precise question: given the symmetric group $S\_n$ with identity element and a linear (homogeneous) equation $$x\_1^{a\_1}x\_2^{a\_2}\cdots x\_k^{a\_k}=e$$ 


can we give general upper and lower bounds for the maximal size of a set $A \subset S\_n$ without trivial solutions to the equation? Additionally, does this value depend on the invariance of the equation?


Here, by invariance I mean that the element $(\sigma,\dots,\sigma)$ is a solution to the equation for all permutations $\sigma \in S\_n$. 



(Extremal) arithmetic combinatorics in non-abelian groups
For the sake of getting this question off the unanswered stack, let me turn some of the comments into a question.


1. Noam Elkies' comment: if one considers arbitrary subsets of $S\_n$, then one can find equations for which there are very large subsets of $S\_n$ containing no solutions. For instance $x\_1x\_2x\_3=1$ has no solutions in $S\_n\setminus A\_n$.
2. If one restricts to subsets of $A\_n$, then one can exploit the fact that $A\_n$ is perfect and so all non-trivial rep's have degree at least $2$. In fact, if $n\geq 7$, the minimal dimension of a non-trivial rep is $n-1$. Now the following paper is relevant:


*W. T. Gowers*, MR 2410393 [**Quasirandom groups**](http://dx.doi.org/10.1017/S0963548307008826), *Combin. Probab. Comput.* **17** (2008), no. 3, 363--387.


One of the main results in this paper gives conditions under which the equation $x\_1x\_2=x\_3$ has solutions, and this theorem can be applied directly to $A\_n$. The result in question is:



> 
> **Theorem 3.3**. Let $\Gamma$ be a finite group with no non-trivial representation of dimension less than $k$, let $n=|\Gamma|$ and let $A,B$ and $C$ be three subsets of $\Gamma$ such that $|A||B||C|>n^3/k$. Then there exist $a\in A, b\in B$ and $c\in C$ with $ab=c$. In particular, this is true if all of $A,B$ and $C$ have size greater than $n/k^{1/3}$.
> 
> 
> 


The theorem goes on to give a lower bound for the number of solutions to the given equation. Generalizations of the theorem -- to equations involving more than three variables -- are discussed in Section 5 of the above paper.


Returning to the three variable situation, one should note that Kedlaya has proved a kind of converse to the above theorem, suggesting that the answer that Gowers gives for this equation is about as good as one could hope for. The paper of Kedlaya is:


K. S. Kedlaya, *Product-free subsets of groups,
then and now*, <http://arXiv:0708.2295v1>.


I don't know of any results concerning the other formulations of the OP's question -- where one has powers of variables in the equation.


