中文
相关论文

相关论文: On the orders of composition factors in completely…

200 篇论文

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…

群论 · 数学 2018-03-15 S. P. Glasby , Cheryl E. Praeger , Kyle Rosa , Gabriel Verret

In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every…

群论 · 数学 2023-03-07 Valentina Grazian , Carmine Monetta , Marialaura Noce

Let $ VG $ be a finite primitive affine permutation group, where $ V $ is a vector space of dimension $ d $ over the prime field $ \mathbb{F}_p $ and $ G $ is an irreducible linear group on $ V $. We prove that if $ p $ divides $ |G| $,…

群论 · 数学 2023-05-08 Saveliy V. Skresanov

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…

群论 · 数学 2022-05-10 Attila Maróti , Saveliy V. Skresanov

Let $q$ be a power of a prime $p$ and let $G$ be a completely reducible subgroup of $\mathrm{GL}(d,q)$. We prove that the number of composition factors of $G$ that have prime order $p$ is at most $(\varepsilon_q d-1)/(p-1)$, where…

群论 · 数学 2017-08-10 Michael Giudici , S. P. Glasby , Cai Heng Li , Gabriel Verret

Let $G$ be a finite group of order $n$, and denote by $\rho(G)$ the product of element orders of $G$. The aim of this work is to provide some upper bounds for $\rho(G)$ depending only on $n$ and on its least prime divisor, when $G$ belongs…

群论 · 数学 2023-01-12 Elena Di Domenico , Carmine Monetta , Marialaura Noce

We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order $p$, acting on a finite set of given size $n$, which is sharp for certain $n$ and $p$. Namely, we prove that if $n\equiv k\pmod{p}$…

组合数学 · 数学 2022-10-28 Cheryl E. Praeger , Enoch Suleiman

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…

群论 · 数学 2024-09-25 Kamilla Rekvényi

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…

群论 · 数学 2013-01-23 Simon Guest , Joy Morris , Cheryl Praeger , Pablo Spiga

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…

群论 · 数学 2023-10-03 Geoffrey R. Robinson

Following partially a suggestion by Pyber, we prove that the diameter of a product of non-abelian finite simple groups is bounded linearly by the maximum diameter of its factors. For completeness, we include the case of abelian factors and…

群论 · 数学 2022-12-13 Daniele Dona

We continue the study of prime graphs of finite groups, also known as Gruenberg-Kegel graphs. The vertices of the prime graph of a finite group are the prime divisors of the group order, and two vertices $p$ and $q$ are connected by an edge…

The strong isomorphism classes of extensions of finite groups are parametrized by orbits of a prescribed action on the second cohomology group. We study these orbits in the case of extensions of a finite abelian $p$-group by a cyclic factor…

群论 · 数学 2023-09-25 Oihana Garaialde Ocaña , Mima Stanojkovski

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

群论 · 数学 2026-04-21 Sean Eberhard , Elena Maini , Luca Sabatini , Gareth Tracey

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…

Inspired by recent work of Farb, Kisin and Wolfson, we develop a method for using actions of finite group schemes over a mixed characteristic dvr R to get lower bounds for the essential dimension of a cover of a variety over K = Frac(R). We…

代数几何 · 数学 2021-02-16 Najmuddin Fakhruddin , Rijul Saini

Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…

群论 · 数学 2014-09-02 E. I. Khukhro , P. Shumyatsky

We propose upper bounds for the number of modular constituents of the restriction modulo $p$ of a complex irreducible character of a finite group, and for its decomposition numbers, in certain cases.

表示论 · 数学 2018-03-16 Gunter Malle , Gabriel Navarro , Benjamin Sambale

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

数论 · 数学 2020-06-30 Komal Agrawal , Paul Pollack

The behavior of the images of a fixed element of order p in irreducible representations of a classical algebraic group in odd characteristic p with highest weights large enough with respect to p and this element is investigated. Lower…

表示论 · 数学 2007-05-23 I. D. Suprunenko
‹ 上一页 1 2 3 10 下一页 ›