We denote the smallest size of a generating set of a group G by . We prove that for irreducible subgroups G of , and estimate the associated constants. The result is motivated by attempts to bound the complexity of computing the automorphism groups of various classes of finite groups
AbstractWe develop a general formula for the order of the group of automorphisms Aut(G) of a monolit...
AbstractLet G be a finite group. Denote by r(G) the least cardinality of a subset A of G, satisfying...
We prove explicit bounds on the numbers of elements needed to generate various types of finite permu...
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
A generating set for a finite group G is minimal if no proper subset generates G, and m(G) denotes t...
Denote by d=d(G) and m=m(G), respectively, the smallest and the largest cardinality of a minimal gen...
Denote by d=d(G) and m=m(G), respectively, the smallest and the largest cardinality of a minimal gen...
Denote by m(G) the largest size of a minimal generating set of a finite group G. We want to estimate...
We prove explicit bounds on the numbers of elements needed to generate various types of finite permu...
AbstractA subset S of a finite group G invariably generates G if G=〈sg(s)|s∈S〉 for each choice of g(...
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...
Abstract. Let V be a finite vector space over a finite field of order q and of characteristic p. Let...
In this thesis we consider base size and properties of the generating graph for finite groups. L...
AbstractWe develop a general formula for the order of the group of automorphisms Aut(G) of a monolit...
AbstractLet G be a finite group. Denote by r(G) the least cardinality of a subset A of G, satisfying...
We prove explicit bounds on the numbers of elements needed to generate various types of finite permu...
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
A generating set for a finite group G is minimal if no proper subset generates G, and m(G) denotes t...
Denote by d=d(G) and m=m(G), respectively, the smallest and the largest cardinality of a minimal gen...
Denote by d=d(G) and m=m(G), respectively, the smallest and the largest cardinality of a minimal gen...
Denote by m(G) the largest size of a minimal generating set of a finite group G. We want to estimate...
We prove explicit bounds on the numbers of elements needed to generate various types of finite permu...
AbstractA subset S of a finite group G invariably generates G if G=〈sg(s)|s∈S〉 for each choice of g(...
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...
Abstract. Let V be a finite vector space over a finite field of order q and of characteristic p. Let...
In this thesis we consider base size and properties of the generating graph for finite groups. L...
AbstractWe develop a general formula for the order of the group of automorphisms Aut(G) of a monolit...
AbstractLet G be a finite group. Denote by r(G) the least cardinality of a subset A of G, satisfying...
We prove explicit bounds on the numbers of elements needed to generate various types of finite permu...
DOI
Add to ORKG