Abstract
We show that the product replacement algorithm can be used to produce random elements of the Monster group. These random elements are shown to have the same distribution of element orders as uniformly distributed random elements after a small number of steps.
| Original language | English |
|---|---|
| Pages (from-to) | 123-126 |
| Number of pages | 4 |
| Journal | Journal of Experimental Mathematics |
| Volume | 12 |
| Issue number | 1 |
| Publication status | Published - 2003 |
Keywords
- monster group
- randomised algorithms