The probability of generating a nilpotent subgroup of a finite group

2008 ◽  
Vol 40 (4) ◽  
pp. 568-580
Author(s):  
John S. Wilson
2012 ◽  
Vol 93 (3) ◽  
pp. 325-332 ◽  
Author(s):  
PAVEL SHUMYATSKY

AbstractLet $w$ be a multilinear commutator word. We prove that if $e$ is a positive integer and $G$ is a finite group in which any nilpotent subgroup generated by $w$-values has exponent dividing $e$, then the exponent of the corresponding verbal subgroup $w(G)$ is bounded in terms of $e$ and $w$only.


Author(s):  
ELOISA DETOMI ◽  
MARTA MORIGI ◽  
PAVEL SHUMYATSKY

Abstract We show that if w is a multilinear commutator word and G a finite group in which every metanilpotent subgroup generated by w-values is of rank at most r, then the rank of the verbal subgroup $w(G)$ is bounded in terms of r and w only. In the case where G is soluble, we obtain a better result: if G is a finite soluble group in which every nilpotent subgroup generated by w-values is of rank at most r, then the rank of $w(G)$ is at most $r+1$ .


2019 ◽  
Vol 18 (10) ◽  
pp. 1950200
Author(s):  
Chi Zhang ◽  
Alexander N. Skiba

Let [Formula: see text] be a partition of the set [Formula: see text] of all primes and [Formula: see text] a finite group. A chief factor [Formula: see text] of [Formula: see text] is said to be [Formula: see text]-central if the semidirect product [Formula: see text] is a [Formula: see text]-group for some [Formula: see text]. [Formula: see text] is called [Formula: see text]-nilpotent if every chief factor of [Formula: see text] is [Formula: see text]-central. We say that [Formula: see text] is semi-[Formula: see text]-nilpotent (respectively, weakly semi-[Formula: see text]-nilpotent) if the normalizer [Formula: see text] of every non-normal (respectively, every non-subnormal) [Formula: see text]-nilpotent subgroup [Formula: see text] of [Formula: see text] is [Formula: see text]-nilpotent. In this paper we determine the structure of finite semi-[Formula: see text]-nilpotent and weakly semi-[Formula: see text]-nilpotent groups.


2015 ◽  
Vol 93 (3) ◽  
pp. 447-453 ◽  
Author(s):  
S. M. JAFARIAN AMIRI ◽  
H. MADADI ◽  
H. ROSTAMI

Let $G$ be a finite group. We denote by ${\it\nu}(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup and by $\text{Nil}_{G}(x)$ the set of elements $y\in G$ such that $\langle x,y\rangle$ is a nilpotent subgroup. A group $G$ is called an ${\mathcal{N}}$-group if $\text{Nil}_{G}(x)$ is a subgroup of $G$ for all $x\in G$. We prove that if $G$ is an ${\mathcal{N}}$-group with ${\it\nu}(G)>\frac{1}{12}$, then $G$ is soluble. Also, we classify semisimple ${\mathcal{N}}$-groups with ${\it\nu}(G)=\frac{1}{12}$.


Author(s):  
YANJUN LIU ◽  
WOLFGANG WILLEMS

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.


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

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.


2021 ◽  
Vol 58 (2) ◽  
pp. 335-346
Author(s):  
Mackenzie Simper

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.


Sign in / Sign up

Export Citation Format

Share Document