Random bases for coprime linear groups

Abstract

The minimal base size b(G) for a permutation group G, is a widely studied topic in the permutation group theory. Z. Halasi and K. Podoski proved that b(G)≤ 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 G≤ GL(V), whether there exists a constant c such that the probability of that a random c-tuple is a base for G tends to 1 as |V|∞. While the answer to this question is negative in general, it is positive under the additional assumption that G is even primitive as a linear group. In this paper, we show that almost all 11-tuples are bases for coprime primitive linear groups.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…