Related papers: The Minimum Generating Set Problem

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

For a finite group $G$, the size of a minimum generating set of $G$ is denoted by $d(G)$. Given a finite group $G$ and an integer $k$, deciding if $d(G)\leq k$ is known as the minimum generating set (MIN-GEN) problem. A group $G$ of order…

A subset $S$ of a group $G$ invariably generates $G$ if, when each element of $S$ is replaced by an arbitrary conjugate, the resulting set generates $G.$ An invariable generating set $X$ of $G$ is called minimal if no proper subset of $X$…

Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest…

A generating set $S$ for a group $G$ is independent if the subgroup generated by $S\setminus \{s\}$ is properly contained in $G$, for all $s \in S.$ In this paper, we study a problem proposed by Peter Glasby: we investigate finite groups,…

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, given a finite almost simple group $G$ and any maximal subgroup $H$ of $G$, we determine a precise upper bound for $d(H)$. In…

In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…

The generating graph encodes how generating pairs are spread among the elements of a group. For more than ten years it has been conjectured that this graph is connected for every finite group. In this paper, we give evidence supporting this…

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…

Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…

For a group $G$ and a finite set $A$, denote by $\text{End}(A^G)$ the monoid of all continuous shift commuting self-maps of $A^G$ and by $\text{Aut}(A^G)$ its group of units. We study the minimal cardinality of a generating set, known as…

This paper presents a novel proof that for any convex cone, the size of conically independent generators is at most twice that of minimum cardinality generators. While this result is known for linear spaces, we extend it to general cones…

The diameter of a finite group $G$ with respect to a generating set $A$ is the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A \cup A^{-1}$. We denote this invariant…

For a group $G$ and a finite set $A$, denote by $\text{CA}(G;A)$ the monoid of all cellular automata over $A^G$ and by $\text{ICA}(G;A)$ its group of units. We study the minimal cardinality of a generating set, known as the rank, of…

We refer to $d(G)$ as the minimal cardinality of a generating set of a finite group $G$, and say that $G$ is $d$-generated if $d(G)\leq d$. A transitive permutation group $G$ is called $\frac{3}{2}$-transitive if a point stabilizer…

We study test sets: subfamilies of sequences converging to a point P that still suffice to detect every discontinuity of real-valued functions at P. Ordered by inclusion, these test sets form a poset. Under natural hypotheses at P, we prove…

We establish an upper bound on the cardinality of a minimal generating set for the fundamental group of a large family of connected, balanced simplicial complexes and, more generally, simplicial posets.

Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…

A smallest generating set of a semigroup is a generating set of the smallest cardinality. Similarly, an irredundant generating set $X$ is a generating set such that no proper subset of $X$ is also a generating set. A semigroup $S$ is…

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…