Related papers: Large minimal invariable generating sets in the fi…

Whiston proved that the maximum size of an irredundant generating set in the symmetric group $S_n$ is $n-1$, and Cameron and Cara characterized all irredundant generating sets of $S_n$ that achieve this size. Our goal is to extend their…

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$…

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…

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…

Given a finite group $G$, the invariably generating graph of $G$ is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of $G$, and two classes are adjacent if and only if they invariably generate $G$.…

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…

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)}…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

A generating set for a finite group $G$ is said to be 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…

Semistability at infinity is an asymptotic property of finitely presented groups that is needed in order to effectively define the fundamental group at infinity for a 1-ended group. It is an open problem whether or not all finitely…

We prove a result on the asymptotic proportion of randomly chosen pairs of permutations in the symmetric group $S_n$ which "invariably" generate a nonsolvable subgroup, i.e., whose cycle structures cannot possibly both occur in the same…

Let $G$ be a finite group. In order to determine the smallest cardinality $d(G)$ of a generating set of $G$ and a generating set with this cardinality, one should repeat many times the test whether a subset of $G$ of small cardinality…

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…

Given a sequence of $(G_i)_{i \in \N}$ of finite transitive groups of degree $n_i$, let $W_\infty$ be the inverse limit of the iterated permutational wreath products of the first m groups. We prove that $W_\infty$ is (topologically)…

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…

Answering a question of Geoff Robinson, we compute the large n limiting proportion of i(n,q)/q^[n^2/2], where i(n,q) denotes the number of involutions in GL(n,q). We give similar results for the finite unitary, symplectic, and orthogonal…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

Let $G$ be a permutation group acting on a finite set $\Omega$ of cardinality $n$. The number of orbits of the induced action of $G$ on the set $\Omega_m$ of all size $m$ subsets of $\Omega$ satisfies the trivial inequalities…

If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…

The functions $F_{G}(n)$ measures the asymptotic behavior of residual finiteness for a finitely generated group $G$. In previous work \cite{Pengitore_1}, the author claimed a characterization for $F_{N}(n)$ when $N$ is a finitely generated…