相关论文: Derangements in simple and primitive groups

We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…

We classify the regular maps $\mathcal M$ which have automorphism groups $G$ acting faithfully and primitively on their vertices. As a permutation group $G$ must be of almost simple or affine type, with dihedral point stabilisers. We show…

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ is said to invariably generate $G$ if the set $\{g_1^{x_1}, \ldots, g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected…

In this paper we analyze the structure of transitive permutation groups that have trivial four point stabilizers, but some nontrivial three point stabilizer. In particular we give a complete, detailed classification when the group is simple…

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

If G is a finite group, then Pr(G) denotes the fraction of ordered pairs of elements of G which commute. We show that, if l \in (2/9,1] is a limit point of the function Pr on finite groups, then l \in \Q and there exists an e = e_l > 0 such…

We prove a conjecture of Peter Neumann from 1966, predicting that every finite non-regular primitive permutation group of degree $n$ contains an element fixing at least one point and at most $n^{1/2}$ points. In fact, we prove a stronger…

Let $\alpha$ and $\beta$ be uniformly random permutations of orders $2$ and $3$, respectively, in $S_{N}$, and consider, say, the permutation $\alpha\beta\alpha\beta^{-1}$. How many fixed points does this random permutation have on average?…

We construct a sequence of primitive-stable representations of free groups into PSL(2,C) whose ranks go to infinity, but whose images are discrete with quotient manifolds that converge geometrically to a knot complement. In particular this…

We give an explicit characterization of solvable factors in factorizations of finite classical groups of Lie type. This completes the classification of solvable factors in factorizations of almost simple groups, finishing the program…

Starting from context-free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their co-word problems are context-free, analyze torsion elements, and realize…

A subset of a group invariably generates the group if it generates even when we replace the elements by any of their conjugates. In a 2016 paper, Pemantle, Peres and Rivin show that the probability that four randomly selected elements…

A permutation group is {\it binary} if its orbits on $k$-tuples, for any integer $k\geq 2$, can be deduced from its orbits on $2$-tuples. Cherlin conjectured that a finite primitive binary permutation group $G$ must lie in one of three…

We present a new killing-a-fly-with-a-sledgehammer proof of one of the oldest results in probability which says that the probability that a random permutation on $n$ elements has no fixed points tends to $e^{-1}$ as $n$ tends to infinity.…

A transitive simple subgroup of a finite symmetric group is very rarely contained in a full wreath product in product action. All such simple permutation groups are determined in this paper. This remarkable conclusion is reached after a…

We conjecture that if $G$ is a finite primitive group and if $g$ is an element of $G$, then either the element $g$ has a cycle of length equal to its order, or for some $r,m$ and $k$, the group $G\leq S_m\wr S_r$, preserving a product…

The paper is intended to be a survey on some topics within the framework of automorphisms of a relatively free groups of infinite rank. We discuss such properties as tameness, primitivity, small index, Bergman property, and so on.

In combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number. In this paper, as natural companions to derangement numbers and degenerate…

In this paper we prove that every automorphism of a Chevalley group (or its elementary subgroup) with root system of rank >1 over a commutative ring (with 1/2 for the systems A_2, F_4, B_l, C_l; with 1/2 and 1/3 for the system G_2) is…

We give new upper bounds for the diameters of finite groups which do not depend on a choice of generating set. Our method exploits the commutator structure of certain profinite groups, in a fashion analogous to the Solovay-Kitaev procedure…