Green's Open Problems #79

### What is the conjecture
https://people.maths.ox.ac.uk/greenbj/papers/open-problems.pdf#problem.79

Pick $x\_1, ..., x\_k \in A\_n$ (the alternating group on $n$ letters) at random. Is it true that, almost surely as $n \to \infty$, the random walk on this set of generators and their inverses equidistributes in time $O(n \log n)$?

### [AMS categories](https://github.com/google-deepmind/formal-conjectures/labels?q=ams-)

* ams-60
* ams-20

### Choose either option
- [ ] I plan on adding this conjecture to the repository
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else

Read problem 79 in the linked Green PDF, then inspect the formal-conjectures repository's existing formalized statements for a suitable approach. Done means the random-walk equidistribution conjecture is added as a Lean formalization with the listed AMS categories.

Written by the indexing model from the issue text.