Skip to Main content Skip to Navigation
Conference papers

An analogue to Dixon's theorem for automaton groups

Abstract : Dixon's famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that it is hopeless to wish for a uniform distribution – or even a non-trivial one – by drawing random permutations and looking at the generated group. Mealy automata are a powerful tool to generate groups, including all finite groups and many interesting infinite ones, whence the idea of generating random finite groups by drawing random Mealy automata. In this paper we show that, for a special class of Mealy automata that generate only finite groups, the distribution is far from being uniform since the obtained groups are generically a semi-direct product between a direct product of alternating groups and a group generated by a tuple of transpositions.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : thibault godin Connect in order to contact the contributor
Submitted on : Monday, October 10, 2016 - 6:09:51 PM
Last modification on : Tuesday, December 8, 2020 - 10:05:14 AM
Long-term archiving on: : Saturday, February 4, 2017 - 1:36:00 AM


Files produced by the author(s)


  • HAL Id : hal-01378815, version 1
  • ARXIV : 1610.03301


Thibault Godin. An analogue to Dixon's theorem for automaton groups. Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Conrado Martínez; Mark Daniel Ward, Jan 2017, Barcelone, Spain. ⟨hal-01378815⟩



Record views


Files downloads