scholarly journals Bounding the maximal size of independent generating sets of finite groups

2020 ◽  
pp. 1-18
Author(s):  
Andrea Lucchini ◽  
Mariapia Moscatiello ◽  
Pablo Spiga
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Prime Numbers ◽  
Generating Set ◽  
Generating Sets ◽  
Number Of Generators ◽  
Maximal Size ◽  
A Finite Group ◽  
Minimal Generating Set

Abstract Denote by m(G) the largest size of a minimal generating set of a finite group G. We estimate m(G) in terms of $\sum _{p\in \pi (G)}d_p(G),$ where we are denoting by d p (G) the minimal number of generators of a Sylow p-subgroup of G and by π(G) the set of prime numbers dividing the order of G.

scholarly journals Splitting Groups with Basis Property

2014 ◽  
Vol 2014 ◽  
pp. 1-4
Author(s):  
Abdullah Aljouiee
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Special Kind ◽  
Basis Property ◽  
Generating Set ◽  
A Finite Group ◽  
Minimal Generating Set

A finite group G is called splitting or splittable if it is a union of some collections of its proper subgroups intersecting pairwise at the identity. A special kind of splitting is known to be normal splitting. Also, a group G is said to have the basis property if, for each subgroup H≤G, H has a basis (minimal generating set), and any two bases have the same cardinality. In this work, I discuss a relation between classes of finite groups that possess both normal splitting and the basis property. This paper shows mainly that any non-p-group with basis property is normal splitting. However, the converse is not true in general. A counterexample is given. It is well known that any p-group has basis property. I demonstrate some types of p-groups which are splitting as well.

scholarly journals A Study About One Generation of Finite Simple Groups and Finite Groups

2021 ◽  
Vol 13 (3) ◽  
pp. 59
Author(s):  
Nader Taffach
Keyword(s):  
Finite Group ◽  
Simple Group ◽  
Finite Groups ◽  
Prime Numbers ◽  
Simple Groups ◽  
Finite Simple Groups ◽  
A Finite Group

In this paper, we study the problem of how a finite group can be generated by some subgroups. In order to the finite simple groups, we show that any finite non-abelian simple group can be generated by two Sylow p1 - and p_2 -subgroups, where p_1  and p_2  are two different primes. We also show that for a given different prime numbers p  and q , any finite group can be generated by a Sylow p -subgroup and a q -subgroup.

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.

Generalization of the basis property on finite groups

2020 ◽  
pp. 2150111
Author(s):  
Ibrahim Al-Dayel ◽  
Ahmad Al Khalaf
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Frobenius Group ◽  
Sufficient Conditions ◽  
Basis Property ◽  
Generating Set ◽  
Equivalent Basis ◽  
Necessary And Sufficient ◽  
Special Case ◽  
Minimal Generating Set

A group [Formula: see text] has the Basis Property if every subgroup [Formula: see text] of [Formula: see text] has an equivalent basis (minimal generating set). We studied a special case of the finite group with the Basis Property, when [Formula: see text]-group [Formula: see text] is an abelian group. We found the necessary and sufficient conditions on an abelian [Formula: see text]-group [Formula: see text] of [Formula: see text] with the Basis Property to be kernel of Frobenius group.

scholarly journals Random walks on generating sets for finite groups

10.37236/1322 ◽  
1996 ◽  
Vol 4 (2) ◽  
Author(s):  
F. R. K. Chung ◽  
R. L. Graham
Keyword(s):  
Finite Group ◽  
Random Walk ◽  
Random Walks ◽  
Finite Groups ◽  
Mixing Time ◽  
Cartesian Product ◽  
Generating Sets ◽  
Random Elements ◽  
A Finite Group

We analyze a certain random walk on the cartesian product $G^n$ of a finite group $G$ which is often used for generating random elements from $G$. In particular, we show that the mixing time of the walk is at most $c_r n^2 \log n$ where the constant $c_r$ depends only on the order $r$ of $G$.

Integral Cayley Graphs over Finite Groups

2020 ◽  
Vol 27 (01) ◽  
pp. 131-136
Author(s):  
Elena V. Konstantinova ◽  
Daria Lytkina
Keyword(s):  
Finite Group ◽  
Symmetric Group ◽  
Cayley Graph ◽  
Cyclic Group ◽  
Finite Groups ◽  
Cayley Graphs ◽  
Alternating Group ◽  
Generating Set ◽  
A Finite Group

We prove that the spectrum of a Cayley graph over a finite group with a normal generating set S containing with every its element s all generators of the cyclic group 〈s〉 is integral. In particular, a Cayley graph of a 2-group generated by a normal set of involutions is integral. We prove that a Cayley graph over the symmetric group of degree n no less than 2 generated by all transpositions is integral. We find the spectrum of a Cayley graph over the alternating group of degree n no less than 4 with a generating set of 3-cycles of the form (k i j) with fixed k, as {−n+1, 1−n+1, 22 −n+1, …, (n−1)2 −n+1}.

scholarly journals The independence graph of a finite group

2020 ◽  
Vol 193 (4) ◽  
pp. 845-856
Author(s):  
Andrea Lucchini
Keyword(s):  
Finite Group ◽  
Planar Graph ◽  
Generating Set ◽  
Delta G ◽  
A Finite Group ◽  
Minimal Generating Set

Abstract Given a finite group G, we denote by $$\Delta (G)$$ Δ ( G ) the graph whose vertices are the elements G and where two vertices x and y are adjacent if there exists a minimal generating set of G containing x and y. We prove that $$\Delta (G)$$ Δ ( G ) is connected and classify the groups G for which $$\Delta (G)$$ Δ ( G ) is a planar graph.

On the spectrum of Cayley graphs related to the finite groups

Filomat ◽  
2017 ◽  
Vol 31 (20) ◽  
pp. 6419-6429 ◽  
Author(s):  
Modjtaba Ghorbani ◽  
Farzaneh Nowroozi-Larki
Keyword(s):  
Finite Group ◽  
Cayley Graph ◽  
Finite Groups ◽  
Cayley Graphs ◽  
Prime Numbers ◽  
A Finite Group

Let G be a finite group of order pqr where p > q > r > 2 are prime numbers. In this paper, we find the spectrum of Cayley graph Cay(G,S) where S ? G \ {e} is a normal symmetric generating subset.

scholarly journals The Generalized Order-kLucas Sequences in Finite Groups

2012 ◽  
Vol 2012 ◽  
pp. 1-15
Author(s):  
Ömür Deveci ◽  
Erdal Karaduman
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Generating Set ◽  
Lucas Sequences ◽  
A Finite Group ◽  
Generalized Order

We study the generalized order-kLucas sequences modulom. Also, we define theith generalized order-kLucas orbitlAi,{α1,α2,…,αk-1}(G) with respect to the generating setAand the constantsα1,α2, andαk-1for a finite groupG=〈A〉. Then, we obtain the lengths of the periods of theith generalized order-kLucas orbits of the binary polyhedral groups〈n,2,2〉,〈2,n,2〉,〈2,2,n〉and the polyhedral groups(n,2,2),(2,n,2),(2,2,n)for1≤i≤k.

Sign in / Sign up

Export Citation Format

Share Document