Random bases for coprime linear groups
Group Theory
2019-03-05 v1
Abstract
The minimal base size for a permutation group , is a widely studied topic in the permutation group theory. Z. Halasi and K. Podoski proved that for coprime linear groups. Motivated by this result and the probabilistic method used by T. C. Burness, M. W. Liebeck and A. Shalev, it was asked by L. Pyber that for coprime linear groups , whether there exists a constant such that the probability of that a random -tuple is a base for tends to 1 as . While the answer to this question is negative in general, it is positive under the additional assumption that is even primitive as a linear group. In this paper, we show that almost all -tuples are bases for coprime primitive linear groups.
Keywords
Cite
@article{arxiv.1903.00692,
title = {Random bases for coprime linear groups},
author = {Hülya Duyan and Zoltán Halasi and Károly Podoski},
journal= {arXiv preprint arXiv:1903.00692},
year = {2019}
}