On layers in the system of generators of the subdirect product of subgroups of a finite group

2009 ◽  
Vol 19 (1) ◽  
Author(s):  
I. A. Kruglov
Keyword(s):  
Finite Group ◽  
Subdirect Product ◽  
Product Of Subgroups ◽  
A Finite Group

scholarly journals A note on the product of F-subgroups in a finite group

1996 ◽  
Vol 39 (1) ◽  
pp. 37-42 ◽  
Author(s):  
Angel Carocca
Keyword(s):  
Finite Group ◽  
Product Of Subgroups ◽  
Saturated Formations ◽  
A Finite Group

Saturated formations are closed under the product of subgroups which are connected by certain permutability properties.

Permutable subgroups of some finite p-groups

1973 ◽  
Vol 16 (1) ◽  
pp. 90-97 ◽  
Author(s):  
S. E. Stonehewer
Keyword(s):  
Finite Group ◽  
Positive Integer ◽  
Subdirect Product ◽  
Nilpotent Groups ◽  
Permutable Subgroup ◽  
Permutable Subgroups ◽  
Class C ◽  
A Finite Group

A subgroup H of a group G is said to be a permutablesubgroup of G if HK = KH 〈H, K〉 for all subgroups K of G. It is known that a core-free permutable subgroup H of a finite group G is always nilpotent [5]; and even when G is not finite, H is always a subdirect product of finite nilpotent groups [11]. Thus nilpotency is a measure of the extent to which a permutable subgroup differs from being normal. Examples of non-abelian, core-free, permutable subgroups are rare and difficult to construct. The first, due to Thompson [12], had class 2. Further examples of class 2 appeared in [8]. More recently Bradway, Gross and Scott [1] have constructed corresponding to each positive integer c and each prime p ≥ c, a finite p-group possessing a core-free permutable subgroup of class c. In [3] Gross succeeded in dispensing with the requirement p ≥ c.

ON HIGHER FROBENIUS–SCHUR INDICATORS

2021 ◽  
pp. 1-11
Author(s):  
YANJUN LIU ◽  
WOLFGANG WILLEMS
Keyword(s):  
Finite Group ◽  
Representation Theory ◽  
Irreducible Characters ◽  
A Finite Group

Abstract Similarly to the Frobenius–Schur indicator of irreducible characters, we consider higher Frobenius–Schur indicators $\nu _{p^n}(\chi ) = |G|^{-1} \sum _{g \in G} \chi (g^{p^n})$ for primes p and $n \in \mathbb {N}$ , where G is a finite group and $\chi $ is a generalised character of G. These invariants give answers to interesting questions in representation theory. In particular, we give several characterisations of groups via higher Frobenius–Schur indicators.

scholarly journals Finite groups with some weakly pronormal subgroups

2020 ◽  
Vol 18 (1) ◽  
pp. 1742-1747
Author(s):  
Jianjun Liu ◽  
Mengling Jiang ◽  
Guiyun Chen
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
A Finite Group

Abstract A subgroup H of a finite group G is called weakly pronormal in G if there exists a subgroup K of G such that G = H K G=HK and H ∩ K H\cap K is pronormal in G. In this paper, we investigate the structure of the finite groups in which some subgroups are weakly pronormal. Our results improve and generalize many known results.

scholarly journals Random additions in urns of integers

2021 ◽  
Vol 58 (2) ◽  
pp. 335-346
Author(s):  
Mackenzie Simper
Keyword(s):  
Finite Group ◽  
Random Process ◽  
Uniform Distribution ◽  
Discrete Time ◽  
Random Variable ◽  
Urn Model ◽  
Infinite Type ◽  
The Mean ◽  
A Finite Group ◽  
Proof Of Convergence

AbstractConsider an urn containing balls labeled with integer values. Define a discrete-time random process by drawing two balls, one at a time and with replacement, and noting the labels. Add a new ball labeled with the sum of the two drawn labels. This model was introduced by Siegmund and Yakir (2005) Ann. Prob.33, 2036 for labels taking values in a finite group, in which case the distribution defined by the urn converges to the uniform distribution on the group. For the urn of integers, the main result of this paper is an exponential limit law. The mean of the exponential is a random variable with distribution depending on the starting configuration. This is a novel urn model which combines multi-drawing and an infinite type of balls. The proof of convergence uses the contraction method for recursive distributional equations.

𝒫-characters and the structure of finite solvable groups

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Jiakuan Lu ◽  
Kaisun Wu ◽  
Wei Meng
Keyword(s):  
Finite Group ◽  
Maximal Subgroup ◽  
Solvable Group ◽  
Irreducible Character ◽  
Solvable Groups ◽  
Irreducible Constituent ◽  
A Finite Group

AbstractLet 𝐺 be a finite group. An irreducible character of 𝐺 is called a 𝒫-character if it is an irreducible constituent of (1_{H})^{G} for some maximal subgroup 𝐻 of 𝐺. In this paper, we obtain some conditions for a solvable group 𝐺 to be 𝑝-nilpotent or 𝑝-closed in terms of 𝒫-characters.

ON THE REGULAR GRAPH RELATED TO THE G-CONJUGACY CLASSES

2021 ◽  
pp. 1-5
Author(s):  
SH. RAHIMI ◽  
Z. AKHLAGHI
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Conjugacy Class ◽  
Regular Graph ◽  
Simple Graph ◽  
Conjugacy Classes ◽  
A Finite Group

Abstract Given a finite group G with a normal subgroup N, the simple graph $\Gamma _{\textit {G}}( \textit {N} )$ is a graph whose vertices are of the form $|x^G|$ , where $x\in {N\setminus {Z(G)}}$ and $x^G$ is the G-conjugacy class of N containing the element x. Two vertices $|x^G|$ and $|y^G|$ are adjacent if they are not coprime. We prove that, if $\Gamma _G(N)$ is a connected incomplete regular graph, then $N= P \times {A}$ where P is a p-group, for some prime p, $A\leq {Z(G)}$ and $\textbf {Z}(N)\not = N\cap \textbf {Z}(G)$ .

Sign in / Sign up

Export Citation Format

Share Document