scholarly journals COMMUTATIVITY DEGREE OF A CLASS OF FINITE GROUPS AND CONSEQUENCES

2013 ◽  
Vol 88 (3) ◽  
pp. 448-452 ◽  
Author(s):  
RAJAT KANTI NATH
Keyword(s):  
Finite Group ◽  
Semidirect Product ◽  
Finite Groups ◽  
Abelian Groups ◽  
Affirmative Answer ◽  
Finite Abelian Groups ◽  
A Finite Group ◽  
Open Question

AbstractThe commutativity degree of a finite group is the probability that two randomly chosen group elements commute. The object of this paper is to compute the commutativity degree of a class of finite groups obtained by semidirect product of two finite abelian groups. As a byproduct of our result, we provide an affirmative answer to an open question posed by Lescot.

On the probability that an automorphism of a group fixes an element of the group

2019 ◽  
Vol 19 (10) ◽  
pp. 2050198
Author(s):  
Ashish Goyal ◽  
Hemant Kalra ◽  
Deepak Gumber
Keyword(s):  
Finite Group ◽  
Maximal Subgroup ◽  
Finite Groups ◽  
Abelian Groups ◽  
Finite Abelian Groups ◽  
A Finite Group

Let [Formula: see text] be a finite group and let [Formula: see text] denote the probability that a randomly chosen element from [Formula: see text] fixes a randomly chosen element from [Formula: see text]. We classify all finite abelian groups [Formula: see text] such that [Formula: see text] in the cases when [Formula: see text] is the smallest prime dividing [Formula: see text], and when [Formula: see text] is any prime. We also compute [Formula: see text] for some classes of finite groups. As a consequence of our results, we deduce that if [Formula: see text] is a finite [Formula: see text]-group having a cyclic maximal subgroup, then [Formula: see text] divides [Formula: see text].

scholarly journals Duality for finite abelian hypergroups over splitting fields

1979 ◽  
Vol 20 (1) ◽  
pp. 57-70 ◽  
Author(s):  
J.R. McMullen ◽  
J.F. Price
Keyword(s):  
Finite Group ◽  
Duality Theory ◽  
Abelian Groups ◽  
Conjugacy Classes ◽  
Finite Abelian Groups ◽  
Precise Sense ◽  
Classical Duality ◽  
A Finite Group

A duality theory for finite abelian hypergroups over fairly general fields is presented, which extends the classical duality for finite abelian groups. In this precise sense the set of conjugacy classes and the set of characters of a finite group are dual as hypergroups.

The mod ℭ Suspension Theorem

1969 ◽  
Vol 21 ◽  
pp. 684-701 ◽  
Author(s):  
Benson Samuel Brown
Keyword(s):  
Finite Group ◽  
Exact Sequence ◽  
Abelian Groups ◽  
Finitely Generated ◽  
Finite Abelian Groups ◽  
Cw Complexes ◽  
Image Position ◽  
A Finite Group

Our aim in this paper is to prove the general mod ℭ suspension theorem: Suppose that X and Y are CW-complexes,ℭ is a class offinite abelian groups, and that(i) πi(Y) ∈ℭfor all i < n,(ii) H*(X; Z) is finitely generated,(iii) Hi(X;Z) ∈ℭfor all i > k.Then the suspension homomorphismis a(mod ℭ) monomorphism for 2 ≦ r ≦ 2n – k – 2 (when r= 1, ker E is a finite group of order d, where Zd∈ ℭ and is a (mod ℭ) epimorphism for 2 ≦ r ≦ 2n – k – 2The proof is basically the same as the proof of the regular suspension theorem. It depends essentially on (mod ℭ) versions of the Serre exact sequence and of the Whitehead theorem.

scholarly journals Impartial achievement games for generating nilpotent groups

2019 ◽  
Vol 22 (3) ◽  
pp. 515-527
Author(s):  
Bret J. Benesh ◽  
Dana C. Ernst ◽  
Nándor Sieben
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Abelian Groups ◽  
Nilpotent Groups ◽  
Generating Set ◽  
Odd Order ◽  
Impartial Game ◽  
A Finite Group

AbstractWe study an impartial game introduced by Anderson and Harary. The game is played by two players who alternately choose previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins. We determine the nim-numbers of this game for finite groups of the form{T\times H}, whereTis a 2-group andHis a group of odd order. This includes all nilpotent and hence abelian groups.

scholarly journals Modular Representations of Finite Groups with Unsaturated Split (B,N)-Pairs

1980 ◽  
Vol 32 (3) ◽  
pp. 714-733 ◽  
Author(s):  
N. B. Tinberg
Keyword(s):  
Finite Group ◽  
Weyl Group ◽  
Prime Number ◽  
Semidirect Product ◽  
Finite Groups ◽  
Modular Representations ◽  
Characteristic P ◽  
Representations Of Finite Groups ◽  
A Finite Group

1. Introduction.Let p be a prime number. A finite group G = (G, B, N, R, U) is called a split(B, N)-pair of characteristic p and rank n if(i) G has a (B, N)-pair (see [3, Definition 2.1, p. B-8]) where H= B ⋂ N and the Weyl group W= N/H is generated by the set R= ﹛ω 1,… , ω n) of “special generators.”(ii) H= ⋂n∈N n-1Bn(iii) There exists a p-subgroup U of G such that B = UH is a semidirect product, and H is abelian with order prime to p.A (B, N)-pair satisfying (ii) is called a saturated (B, N)-pair. We call a finite group G which satisfies (i) and (iii) an unsaturated split (B, N)- pair. (Unsaturated means “not necessarily saturated”.)

scholarly journals Proficient presentations and direct products of finite groups

1999 ◽  
Vol 60 (2) ◽  
pp. 177-189 ◽  
Author(s):  
K.W. Gruenberg ◽  
L.G. Kovács
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Free Group ◽  
Finite Groups ◽  
Finite Rank ◽  
Module Structure ◽  
Direct Products ◽  
The Difference ◽  
A Finite Group ◽  
Open Question

Let G be a finite group, F a free group of finite rank, R the kernel of a homomorphism φ of F onto G, and let [R, F], [R, R] denote mutual commutator subgroups. Conjugation in F yields a G-module structure on R/[R, R] let dg(R/[R, R]) be the number of elements required to generate this module. Define d(R/[R, F]) similarly. By an earlier result of the first author, for a fixed G, the difference dG(R/[R, R]) − d(R/[R, F]) is independent of the choice of F and φ; here it is called the proficiency gap of G. If this gap is 0, then G is said to be proficient. It has been more usual to consider dF(R), the number of elements required to generate R as normal subgroup of F: the group G has been called efficient if F and φ can be chosen so that dF(R) = dG(R/[R, F]). An efficient group is necessarily proficient; but (though usually expressed in different terms) the converse has been an open question for some time.

scholarly journals Gelfand Pairs Involving the Wreath Product of Finite Abelian Groups with Symmetric Groups

2020 ◽  
pp. 1-7
Author(s):  
Omar Tout
Keyword(s):  
Finite Group ◽  
Symmetric Group ◽  
Wreath Product ◽  
Abelian Groups ◽  
Symmetric Groups ◽  
Gelfand Pair ◽  
Gelfand Pairs ◽  
Finite Abelian Groups ◽  
A Finite Group

Abstract It is well known that the pair $(\mathcal {S}_n,\mathcal {S}_{n-1})$ is a Gelfand pair where $\mathcal {S}_n$ is the symmetric group on n elements. In this paper, we prove that if G is a finite group then $(G\wr \mathcal {S}_n, G\wr \mathcal {S}_{n-1}),$ where $G\wr \mathcal {S}_n$ is the wreath product of G by $\mathcal {S}_n,$ is a Gelfand pair if and only if G is abelian.

On semi-σ-nilpotent finite groups

2019 ◽  
Vol 18 (10) ◽  
pp. 1950200
Author(s):  
Chi Zhang ◽  
Alexander N. Skiba
Keyword(s):  
Finite Group ◽  
Semidirect Product ◽  
Finite Groups ◽  
Nilpotent Groups ◽  
Product Formula ◽  
Nilpotent Subgroup ◽  
Chief Factor ◽  
Group A ◽  
A Finite Group

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.

scholarly journals Disjoint conjugates of cyclic subgroups of finite groups

1977 ◽  
Vol 20 (3) ◽  
pp. 229-232 ◽  
Author(s):  
Thomas J. Laffey
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Cyclic Subgroup ◽  
Affirmative Answer ◽  
Fitting Subgroup ◽  
Cyclic Subgroups ◽  
Result Theorem ◽  
Nontrivial Subgroup ◽  
A Finite Group

In an earlier paper (2) we considered the following question “If S is a cyclic subgroup of a finite group G and S ∩ F(G) = 1, where F(G) is the Fitting subgroup of G, does there necessarily exist a conjugate Sx of S in G with S ∩ Sx = l?” and we gave an affirmative answer for G simple or soluble. In this paper we answer the question affirmatively in general (in fact we prove a somewhat stronger result (Theorem 3)). We give an example of a group G with a cyclic subgroup S such that (i) no nontrivial subgroup of S is normal in G and (ii) no x exists for which S ∩ Sx = 1.

scholarly journals On 𝓕-subnormal subgroups and Frattini-like subgroups of a finite group

1994 ◽  
Vol 36 (2) ◽  
pp. 241-247 ◽  
Author(s):  
A. Ballester-Bolinches ◽  
M. D. Pérez-Ramos
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Nilpotent Groups ◽  
Subnormal Subgroup ◽  
Affirmative Answer ◽  
Saturated Formation ◽  
Frattini Subgroup ◽  
A Finite Group ◽  
Subnormal Subgroups

Throughout the paper we consider only finite groups.J. C. Beidleman and H. Smith [3] have proposed the following question: “If G is a group and Ha subnormal subgroup of G containing Φ(G), the Frattini subgroup of G, such that H/Φ(G)is supersoluble, is H necessarily supersoluble? “In this paper, we give not only an affirmative answer to this question but also we see that the above result still holds if supersoluble is replaced by any saturated formation containing the class of all nilpotent groups.

Sign in / Sign up

Export Citation Format

Share Document