English
Related papers

Related papers: Bounding the composition length of primitive permu…

200 papers

In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…

Group Theory · Mathematics 2018-06-05 Luke Morgan , Cheryl E. Praeger , Kyle Rosa

We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…

Group Theory · Mathematics 2023-06-05 Attila Maróti , Saveliy V. Skresanov

We determine upper bounds for the maximum order of an element of a finite almost simple group with socle T in terms of the minimum index m(T) of a maximal subgroup of T: for T not an alternating group we prove that, with finitely many…

Group Theory · Mathematics 2013-01-23 Simon Guest , Joy Morris , Cheryl Praeger , Pablo Spiga

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

Group Theory · Mathematics 2007-05-23 Cheryl E. Praeger

The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…

Group Theory · Mathematics 2023-09-20 Anton A. Baykalov , Alice Devillers , Cheryl E. Praeger

We prove an upper bound for the number of cyclic transitive subgroups in a finite permutation group and clarify the structure of the groups for which this bound becomes sharp. We also give an application in the theory of number fields.

Group Theory · Mathematics 2015-02-10 Joachim König

We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…

Representation Theory · Mathematics 2019-10-10 Michael Hansen , Masanori Koyama , Matthew B. A. McDermott , Michael E. Orrison , Sarah Wolff

The orbital diameter of a primitive permutation group is the maximal diameter of its orbital graphs. There has been a lot of interest in bounds for the orbital diameter. In this paper we provide explicit bounds on the diameters of groups of…

Group Theory · Mathematics 2021-03-10 Kamilla Rekvényi

We classify finite primitive permutation groups having a suborbit of length 5. As a corollary, we obtain a classification of finite vertex-primitive graphs of valency 5. In the process, we also classify finite almost simple groups that have…

We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such as the full transformation semigroups, the general linear semigroups, and the semigroups of order-preserving transformations of finite…

Group Theory · Mathematics 2019-05-31 Peter J. Cameron , Maximilien Gadouleau , James D. Mitchell , Yann Peresse

General bounds are presented for the diameters of orbital graphs of finite affine primitive permutation groups. For example, it is proved that the orbital diameter of a finite affine primitive permutation group with a nontrivial point…

Group Theory · Mathematics 2022-05-10 Attila Maróti , Saveliy V. Skresanov

An upper bound of composition series of groups of finite order is obtained. The bound is a nontrivial bound and so far best possible.

Group Theory · Mathematics 2022-11-08 Abhijit Bhattacharjee

It is shown that there exists a finitely generated infinite simple group of infinite commutator width, and that the commutator width of a finitely generated infinite boundedly simple group can be arbitrarily large. Besides, such groups can…

Group Theory · Mathematics 2009-09-14 Alexey Muranov

The orbital diameter of a primitive permutation group is the maximal diameter of its orbital graphs. There has been a lot of interest in bounds for the orbital diameter. In this paper we provide explicit bounds on the diameters of groups of…

Group Theory · Mathematics 2024-09-25 Kamilla Rekvényi

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Discrete Mathematics · Computer Science 2011-08-19 Alexander Valyuzhenich

We derive a lower bound on the size of finite non-cyclic quotients of the braid group that is superexponential in the number of strands. We also derive a similar lower bound for nontrivial finite quotients of the commutator subgroup of the…

Geometric Topology · Mathematics 2019-12-12 Alice Chudnovsky , Kevin Kordek , Qiao Li , Caleb Partin

Originally motivated by questions of P. Etingof related to growth rates of tensor powers in symmetric tensor categories, we obtain general bounds on the order of finite subgroups of ${\rm GL}(n,\mathbb{C})$ with restricted composition…

Group Theory · Mathematics 2023-10-03 Geoffrey R. Robinson

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

Group Theory · Mathematics 2019-12-03 Mark Pengitore

We give new, explicit and asymptotically sharp, lower bounds for dimensions of irreducible modular representations of finite symmetric groups.

Representation Theory · Mathematics 2019-09-10 Alexander Kleshchev , Lucia Morotti , Pham Huu Tiep

This is the first paper in a sequence on Krull dimension for limit groups, answering a question of Z. Sela. In this paper we show that strict resolutions of a fixed limit group have uniformly bounded length. The upper bound plays two roles…

Group Theory · Mathematics 2008-12-10 Larsen Louder
‹ Prev 1 2 3 10 Next ›