English

Random bases for coprime linear groups

Group Theory 2019-03-05 v1

Abstract

The minimal base size b(G)b(G) for a permutation group GG, is a widely studied topic in the permutation group theory. Z. Halasi and K. Podoski proved that b(G)2b(G)\leq 2 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 GGL(V)G\leq GL(V), whether there exists a constant cc such that the probability of that a random cc-tuple is a base for GG tends to 1 as V|V|\to\infty. While the answer to this question is negative in general, it is positive under the additional assumption that GG is even primitive as a linear group. In this paper, we show that almost all 1111-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}
}
R2 v1 2026-06-23T07:56:15.142Z