An analogue to Dixon's theorem for automaton groups - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

An analogue to Dixon's theorem for automaton groups


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.
Fichier principal
Vignette du fichier
Dixon_ANALCO_abs.pdf (193.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01378815 , version 1 (10-10-2016)



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⟩
115 View
190 Download



Gmail Facebook X LinkedIn More