English
Related papers

Related papers: On derangements in simple permutation groups

200 papers

Fix $t\in [1,\infty]$. Let $S$ be an atomic commutative semigroup and, for all $x\in S$, let $\mathscr{L}_t(S):=\{\|f\|_t:f\in Z(x)\}$ be the "$t$-length set" of $x$ (using the standard $l_p$-space definition of $\|\cdot\|_t$). The…

Commutative Algebra · Mathematics 2024-04-04 Christopher O'Neill , Vadim Ponomarenko , Eric Ren

The primary purpose of this paper is to report on the successful enumeration in Magma of representatives of the $195\,826\,352$ conjugacy classes of transitive subgroups of the symmetric group $S_{48}$ of degree 48. In addition, we have…

Group Theory · Mathematics 2021-02-26 Derek Holt , Gordon Royle , Gareth Tracey

Let $G$ be a transitive permutation group on $\Omega$. The $G$-invariant partitions form a sublattice of the lattice of all partitions of $\Omega$, having the further property that all its elements are uniform (that is, have all parts of…

Group Theory · Mathematics 2026-01-14 Marina Anagnostopoulou-Merkouri , R. A. Bailey , Peter J. Cameron

Let $\Delta$ be a finite set and $G$ be a subgroup of $\operatorname{Sym}(\Delta)$. An irredundant base for $G$ is a sequence of points of $\Delta$ yielding a strictly descending chain of pointwise stabilisers, terminating with the trivial…

Group Theory · Mathematics 2025-06-25 Sofia Brenner , Coen del Valle , Colva M. Roney-Dougal

The $n$-th rencontres number with the parameter $r$ is the number of permutations having exactly $r$ fixed points. In particular, a derangement is a permutation without any fixed point. We presents a short combinatorial proof for a weighted…

Combinatorics · Mathematics 2017-11-15 Ivica Martinjak , Dajana Stanić

We study pairs $(\Gamma,G)$, where $\Gamma$ is a 'Buekenhout-Tits' pregeometry with all rank 2 truncations connected, and $G\leqslant\mathrm{Aut} \Gamma$ is transitive on the set of elements of each type. The family of such pairs is closed…

Combinatorics · Mathematics 2010-09-02 Michael Giudici , Cai Heng Li , Geoffrey Pearce , Cheryl E. Praeger

Let $G$ be a finite (not necessarily abelian) group and let $p=p(G)$ be the smallest prime number dividing $|G|$. We prove that $d(G)\leq \frac{|G|}{p}+9p^2-10p$, where $d(G)$ denotes the small Davenport constant of $G$ which is defined as…

Number Theory · Mathematics 2013-08-13 Weidong Gao , Yuanlin Li , Jiangtao Peng

Let $F$ be a finitely generated free group and let $H\le F$ be a finitely generated subgroup. Given an element $g\in F$, we study the ideal $\mathfrak{I}_g$ of equations for $g$ with coefficients in $H$, i.e. the elements $w(x)\in H*\langle…

Group Theory · Mathematics 2025-06-25 Dario Ascari

For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$…

Group Theory · Mathematics 2022-03-14 Martin Kassabov , Brady A. Tyburski , James B. Wilson

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…

Number Theory · Mathematics 2017-12-12 Taekyun Kim , Dae san Kim

We derive a uniform bound for the difference of two contractive semigroups, if the difference of their generators is form-bounded by the Hermitian parts of the generators themselves. We construct a semigroup dynamics for second order…

Dynamical Systems · Mathematics 2007-05-23 Kresimir Veselic

Let $G$ be a finite group and let $\mathcal{M}$ be a set of maximal subgroups of $G$. We say that $\mathcal{M}$ is irredundant if the intersection of the subgroups in $\mathcal{M}$ is not equal to the intersection of any proper subset. The…

Group Theory · Mathematics 2019-11-11 Timothy C. Burness , Martino Garonzi , Andrea Lucchini

The problem of describing the invariance groups of unordered relations, called briefly \emph{relation groups}, goes back to classical work by H. Wielandt. In general, the problem turned out to be hard, and so far it has been settled only…

Group Theory · Mathematics 2019-08-28 Mariusz Grech , Andrzej Kisielewicz

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

Group Theory · Mathematics 2018-03-15 S. P. Glasby , Cheryl E. Praeger , Kyle Rosa , Gabriel Verret

The H-type deviation, $\delta({\mathbb G})$, of a step two Carnot group ${\mathbb G}$ quantifies the extent to which ${\mathbb G}$ deviates from the geometrically and algebraically tractable class of Heisenberg-type (H-type) groups. In an…

Differential Geometry · Mathematics 2024-08-01 Luca Nalon , Jeremy T. Tyson

A finite transitive permutation group is said to be 3/2-transitive if all the nontrivial orbits of a point stabilizer have the same size greater than 1. Examples include the 2-transitive groups, Frobenius groups and several other less…

Group Theory · Mathematics 2011-12-14 John Bamberg , Michael Giudici , Martin W. Liebeck , Cheryl E. Praeger , Jan Saxl

Motivated in part by representation theoretic questions, we prove that if G is a finite quasi-simple group, then there exists an elementary abelian subgroup of G that intersects every conjugacy class of involutions of G.

Group Theory · Mathematics 2020-12-17 Robert M. Guralnick , Geoffrey R. Robinson

This note describes the first example of a group that is amenable, but cannot be obtained by subgroups, quotients, extensions and direct limits from the class of groups locally of subexponential growth. It has a balanced presentation…

Group Theory · Mathematics 2007-05-23 Laurent Bartholdi

Recall that a subset $X$ of a group $G$ is 'product-free' if $X^2\cap X=\varnothing$, ie if $xy\notin X$ for all $x,y\in X$. Let $G$ be a group definable in a distal structure. We prove there are constants $c>0$ and $\delta\in(0,1)$ such…

Combinatorics · Mathematics 2023-04-20 Atticus Stonestrom

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…

Group Theory · Mathematics 2018-11-28 Andrea Lucchini , Gareth Tracey