A generating set for a finite group G is minimal if no proper subset generates G, and m(G) denotes the maximal size of a minimal generating set for G. We prove a conjecture of Lucchini, Moscatiello and Spiga by showing that there exist a,b > 0 such that any finite group G satisfies m(G)⩽a⋅δ(G)b, for δ(G)=∑p primem(Gp), where Gp is a Sylow p-subgroup of G. To do this, we first bound m(G) for all almost simple groups of Lie type (until now, no nontrivial bounds were known except for groups of rank 1 or 2). In particular, we prove that there exist a,b > 0 such that any finite simple group G of Lie type of rank r over the field Fpf satisfies r+ω(f)⩽m(G)⩽a(r+ω(f))b, where ω(f) denotes the number of distinct prime divisors of f. In the proc...
We characterize Abelian groups with a minimal generating set: Let τ A denote the maximal torsion sub...
AbstractGiven a group G and positive integers r,s≤|G|, we denote by μG(r,s) the least possible size ...
AbstractA subset S of a finite group G invariably generates G if G=〈sg(s)|s∈S〉 for each choice of g(...
We study how the largest size m(G) of a minimal generating set of a finite group G can be computed
We study how the largest size m(G) of a minimal generating set of a finite group G can be computed
Denote by m(G) the largest size of a minimal generating set of a finite group G. We want to estimate...
We denote the smallest size of a generating set of a group G by . We prove that for irreducible sub...
In this thesis we consider base size and properties of the generating graph for finite groups. L...
Abstract. Let V be a finite vector space over a finite field of order q and of characteristic p. Let...
Abstract. Let G be a non-cyclic finite group that can be generated by two elements. A subset S of G ...
For a finite group G we investigate the difference between the maximum size MaxDim (G) of an \u201ci...
Let G be a permutation group acting on a set Ω. A subset of Ω is a base for G if its pointwise stabi...
Let G be a finite group. It has recently been proved that every nontrivial element of G is contained...
Let G be a finite group. It has recently been proved that every nontrivial element of G is contained...
AbstractLet G be a non-cyclic finite group that can be generated by two elements. A subset S of G is...
We characterize Abelian groups with a minimal generating set: Let τ A denote the maximal torsion sub...
AbstractGiven a group G and positive integers r,s≤|G|, we denote by μG(r,s) the least possible size ...
AbstractA subset S of a finite group G invariably generates G if G=〈sg(s)|s∈S〉 for each choice of g(...
We study how the largest size m(G) of a minimal generating set of a finite group G can be computed
We study how the largest size m(G) of a minimal generating set of a finite group G can be computed
Denote by m(G) the largest size of a minimal generating set of a finite group G. We want to estimate...
We denote the smallest size of a generating set of a group G by . We prove that for irreducible sub...
In this thesis we consider base size and properties of the generating graph for finite groups. L...
Abstract. Let V be a finite vector space over a finite field of order q and of characteristic p. Let...
Abstract. Let G be a non-cyclic finite group that can be generated by two elements. A subset S of G ...
For a finite group G we investigate the difference between the maximum size MaxDim (G) of an \u201ci...
Let G be a permutation group acting on a set Ω. A subset of Ω is a base for G if its pointwise stabi...
Let G be a finite group. It has recently been proved that every nontrivial element of G is contained...
Let G be a finite group. It has recently been proved that every nontrivial element of G is contained...
AbstractLet G be a non-cyclic finite group that can be generated by two elements. A subset S of G is...
We characterize Abelian groups with a minimal generating set: Let τ A denote the maximal torsion sub...
AbstractGiven a group G and positive integers r,s≤|G|, we denote by μG(r,s) the least possible size ...
AbstractA subset S of a finite group G invariably generates G if G=〈sg(s)|s∈S〉 for each choice of g(...