Searcharxiv⌕ Search

arXiv · math/0208022

Derangements in simple and primitive groups

Abstract

We investigate the proportion of fixed point free permutations (derangements) in finite transitive permutation groups. This article is the first in a series where we prove a conjecture of Shalev that the proportion of such elements is bounded away from zero for a simple finite group. In fact, there are much stronger results. This article focuses on finite Chevalley groups of bounded rank. We also discuss derangements in algebraic groups and in more general primitive groups. These results have applications in questions about probabilistic generation of finite simple groups and maps between varieties over finite fields.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jason Fulman, Robert Guralnick. 2002-08-03. Derangements in simple and primitive groups. https://searcharxiv.com/abs/math/0208022

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗