scholarly journals A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group

2020 ◽  
Vol 32 (3) ◽  
pp. 713-721
Author(s):  
Andrea Lucchini ◽  
Mariapia Moscatiello ◽  
Pablo Spiga
Keyword(s):  
Finite Group ◽  
Permutation Group ◽  
Maximal Subgroups ◽  
Transitive Permutation Group ◽  
Classic Result ◽  
A Finite Group

AbstractWe show that there exists a constant a such that, for every subgroup H of a finite group G, the number of maximal subgroups of G containing H is bounded above by {a\lvert G:H\rvert^{3/2}}. In particular, a transitive permutation group of degree n has at most {an^{3/2}} maximal systems of imprimitivity. When G is soluble, generalizing a classic result of Tim Wall, we prove a much stronger bound, that is, the number of maximal subgroups of G containing H is at most {\lvert G:H\rvert-1}.

scholarly journals A Characterization of the Simple Group U3(5)

1970 ◽  
Vol 38 ◽  
pp. 27-40 ◽  
Author(s):  
Koichiro Harada
Keyword(s):  
Finite Group ◽  
Simple Group ◽  
Permutation Group ◽  
Transitive Permutation Group ◽  
List Type ◽  
A Finite Group

In this note we consider a finite group G which satisfies the following conditions: (0. 1) G is a doubly transitive permutation group on a set Ω of m + 1 letters, where m is an odd integer ≥ 3,(0. 2) if H is a subgroup of G and contains all the elements of G which fix two different letters α, β, then H contains unique permutation h0 ≠ 1 which fixes at least three letters,(0. 3) every involution of G fixes at least three letters,(0. 4) G is not isomorphic to one of the groups of Ree type.

scholarly journals ON A CLASS OF SUPERSOLUBLE GROUPS

2014 ◽  
Vol 90 (2) ◽  
pp. 220-226 ◽  
Author(s):  
A. BALLESTER-BOLINCHES ◽  
J. C. BEIDLEMAN ◽  
R. ESTEBAN-ROMERO ◽  
M. F. RAGLAND
Keyword(s):  
Finite Group ◽  
Maximal Subgroups ◽  
Supersoluble Groups ◽  
Sylow Subgroups ◽  
A Finite Group

AbstractA subgroup $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}H$ of a finite group $G$ is said to be S-semipermutable in $G$ if $H$ permutes with every Sylow $q$-subgroup of $G$ for all primes $q$ not dividing $|H |$. A finite group $G$ is an MS-group if the maximal subgroups of all the Sylow subgroups of $G$ are S-semipermutable in $G$. The aim of the present paper is to characterise the finite MS-groups.

scholarly journals A generalized Frattini subgroup of a finite group

1989 ◽  
Vol 12 (2) ◽  
pp. 263-266
Author(s):  
Prabir Bhattacharya ◽  
N. P. Mukherjee
Keyword(s):  
Finite Group ◽  
Maximal Subgroups ◽  
Frattini Subgroup ◽  
Definition Of ◽  
A Finite Group

For a finite group G and an arbitrary prime p, letSP(G)denote the intersection of all maximal subgroups M of G such that [G:M] is both composite and not divisible by p; if no such M exists we setSP(G)= G. Some properties of G are considered involvingSP(G). In particular, we obtain a characterization of G when each M in the definition ofSP(G)is nilpotent.

On S-Quasinormal and C-Normal Subgroups of Prime Power Order in Finite Groups

2011 ◽  
Vol 18 (04) ◽  
pp. 685-692
Author(s):  
Xuanli He ◽  
Shirong Li ◽  
Xiaochun Liu
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Prime Power ◽  
Maximal Subgroups ◽  
Prime Power Order ◽  
Normal Subgroups ◽  
A Finite Group

Let G be a finite group, p the smallest prime dividing the order of G, and P a Sylow p-subgroup of G with the smallest generator number d. Consider a set [Formula: see text] of maximal subgroups of P such that [Formula: see text]. It is shown that if every member [Formula: see text] of is either S-quasinormally embedded or C-normal in G, then G is p-nilpotent. As its applications, some further results are obtained.

Finite groups with two supersoluble subgroups

2019 ◽  
Vol 22 (2) ◽  
pp. 297-312 ◽  
Author(s):  
Victor S. Monakhov ◽  
Alexander A. Trofimuk
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Sufficient Conditions ◽  
Maximal Subgroups ◽  
Sylow Subgroups ◽  
Derived Subgroup ◽  
Nilpotent Residual ◽  
A Finite Group

AbstractLetGbe a finite group. In this paper we obtain some sufficient conditions for the supersolubility ofGwith two supersoluble non-conjugate subgroupsHandKof prime index, not necessarily distinct. It is established that the supersoluble residual of such a group coincides with the nilpotent residual of the derived subgroup. We prove thatGis supersoluble in the following cases: one of the subgroupsHorKis nilpotent; the derived subgroup{G^{\prime}}ofGis nilpotent;{|G:H|=q>r=|G:K|}andHis normal inG. Also the supersolubility ofGwith two non-conjugate maximal subgroupsMandVis obtained in the following cases: all Sylow subgroups ofMand ofVare seminormal inG; all maximal subgroups ofMand ofVare seminormal inG.

scholarly journals A remark on the C-normality of maximal subgroups of finite groups

1997 ◽  
Vol 40 (2) ◽  
pp. 243-246
Author(s):  
Yanming Wang
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Finite Groups ◽  
Maximal Subgroups ◽  
Primitive Groups ◽  
A Finite Group

A subgroup H is called c-normal in a group G if there exists a normal subgroup N of G such that HN = G and H∩N ≤ HG, where HG =: Core(H) = ∩g∈GHg is the maximal normal subgroup of G which is contained in H. We use a result on primitive groups and the c-normality of maximal subgroups of a finite group G to obtain results about the influence of the set of maximal subgroups on the structure of G.

A Lower Bound on the Number of Maximal Subgroups in a Finite Group

2020 ◽  
Vol 46 (6) ◽  
pp. 1599-1602
Author(s):  
Jiakuan Lu ◽  
Shenyang Wang ◽  
Wei Meng
Keyword(s):  
Finite Group ◽  
Lower Bound ◽  
Maximal Subgroups ◽  
A Finite Group

scholarly journals Groups fixing graphas in switching classes

1982 ◽  
Vol 33 (1) ◽  
pp. 76-85
Author(s):  
Martin W. Liebeck
Keyword(s):  
Finite Group ◽  
Symmetric Group ◽  
Permutation Group ◽  
Abelian Groups ◽  
Finite Set ◽  
A Finite Group ◽  
Switching Class

AbstractA permutation group G on a finite set Ω is always exposable if whenever G stabilises a switching class of graphs on Ω, G fixes a graph in the switching class. Here we consider the problem: given a finite group G, which permutation representations of G are always exposable? We present solutions to the problem for (i) 2-generator abelian groups, (ii) all abelian groups in semiregular representations. (iii) generalised quaternion groups and (iv) some representations of the symmetric group Sn.

scholarly journals On quasi-permutation representations of finite groups

1994 ◽  
Vol 36 (3) ◽  
pp. 301-308 ◽  
Author(s):  
J. M. Burns ◽  
B. Goldsmith ◽  
B. Hartley ◽  
R. Sandling
Keyword(s):  
Finite Group ◽  
Vector Space ◽  
Permutation Group ◽  
Minimal Degree ◽  
Permutation Representation ◽  
Permutation Groups ◽  
Complex Vector Space ◽  
Complex Vector ◽  
Group Situation ◽  
A Finite Group

In [6], Wong defined a quasi-permutation group of degree n to be a finite group G of automorphisms of an n-dimensional complex vector space such that every element of G has non-negative integral trace. The terminology derives from the fact that if G is a finite group of permutations of a set ω of size n, and we think of G as acting on the complex vector space with basis ω, then the trace of an element g ∈ G is equal to the number of points of ω fixed by g. In [6] and [7], Wong studied the extent to which some facts about permutation groups generalize to the quasi-permutation group situation. Here we investigate further the analogy between permutation groups and quasipermutation groups by studying the relation between the minimal degree of a faithful permutation representation of a given finite group G and the minimal degree of a faithful quasi-permutation representation. We shall often prefer to work over the rational field rather than the complex field.

Sign in / Sign up

Export Citation Format

Share Document