Related papers: How long does it take to generate a group?

For every Lie group $G$, we compute the maximal $n$ such that an $n$-fold product of nonabelian free groups embeds into $G$.

Let $G$ be a group and $A\subseteq G$ a non-empty subset. A right $s$-factor associated with $A$ is a maximal subset $U\subseteq G$ such that the product $AU$ is direct. The lower and upper $s$-indices $|G:A|^-$ and $|G:A|^+$ are defined as…

Suppose that $k\geq 2$ and $A$ is a non-empty subset of a finite abelian group $G$ with $|G|>1$. Then the cardinality of the restricted sumset $$ k^\wedge A:=\{a_1+\cdots+a_k:\,a_1,\ldots,a_k\in A,\ a_i\neq a_j\text{ for }i\neq j\} $$ is at…

In this paper we explore the structure and properties of C-groups. We define a C-group as a group $G$ with $rk(G) < rk(Z(G))$ (where $rk(G)$ is the minimal cardinal of a generating set for a group $G$). Using GAP (a group theory program)…

The generalized Fitting height of a finite group $G$ is the least number $h=h^*(G)$ such that $F^*_h(G)=G$, where the $F^*_i(G)$ is the generalized Fitting series: $F^*_1(G)=F^*(G)$ and $F^*_{i+1}(G)$ is the inverse image of…

Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…

For a nilpotent group $G$, let $\Xi(G)$ be the difference between the complement of the generating graph of $G$ and the commuting graph of $G$, with vertices corresponding to central elements of $G$ removed. That is, $\Xi(G)$ has vertex set…

A group $G$ is called residually finite if for every non-trivial element $g \in G$, there exists a finite quotient $Q$ of $G$ such that the element $g$ is non-trivial in the quotient as well. Instead of just investigating whether a group…

The covering number of a finite group $G$, denoted $\sigma(G)$, is the smallest positive integer $k$ such that $G$ is a union of $k$ proper subgroups. We calculate $\sigma(G)$ for a family of primitive groups $G$ with a unique minimal…

An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…

We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two…

We construct a 2-generated group $\Gamma $ such that its Cayley graph possesses finite connected subsets with arbitrarily big finite Heesch number.

In this paper, we consider the formal power series whose n-th coefficient is the number of copies of a given finite graph in the ball of radius n centred at the identity element in the Cayley graph of a finitely generated group and call it…

For a finite group $G$, let $m_I(G)$ denote the largest possible cardinality of a minimal invariable generating set of $G$. We prove an upper and a lower bound for $m_I(S_n)$, which show in particular that $m_I(S_n)$ is asymptotic to $n/2$…

Given a group word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. In the present paper we consider profinite groups admitting a word $w$ such that the…

Let $G=(V,E)$ be a graph. A set of vertices $A$ is an incidence generator for $G$ if for any two distinct edges $e,f\in E(G)$ there exists a vertex from $A$ which is an endpoint of either $e$ or $f$. The smallest cardinality of an incidence…

We know that any finite abelian group $G$ appears as a subgroup of infinitely many multiplicative groups $\mathbb{Z}_n^\times$ (the abelian groups of size $\phi(n)$ that are the multiplicative groups of units in the rings…

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…

Given a finitely generated group with generating set $S$, we study the cogrowth sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks the…

Given a finite group $G,$ let $e(G)$ be expected number of elements of $G$ which have to be drawn at random, with replacement, before a set of generators is found. If all the Sylow subgroups of $G$ can be generated by $d$ elements, then…