MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

A group $G$ is said to be boundedly generated if (it is finitely generated and) there exists a finite family of cyclic subgroups (not necessarily normal or distinct) $\lbrace C_i \rbrace_{i =1, \ldots, k}$ such that $G = C_1 \cdots C_k$.

Simplest examples of boundedly generated groups are finite groups and polycyclic groups. Free groups are not boundedly generated, and $SL_2(\mathbb{Z})$ also isn't (since passing to finite index subgroups does not change this property).

A priori, the order in the product matters. Assume $G = C_1 \cdots C_k$ is a boundedly generated group so that $G = C_{\sigma(1)} \cdots C_{\sigma(k)}$ for any permutation $\sigma \in Sym_k$. In particular, one may then assume the $C_i$ are distinct. Except virtually polycyclic groups, which group has this property?

share|cite|improve this question
"boundedly generated group where the order of the product does not matter": I don't understand what you mean by this. – YCor Jul 9 '13 at 18:30
oh sorry, that was pretty unclear indeed... – Antoine Jul 9 '13 at 19:07
ok, it's clearly defined now. – YCor Jul 9 '13 at 19:29
Actually, are there constructions of groups with bgp, which are not lattices in Lie/alberaic groups? (Polycyclic groups and groups of integer points in higher rank algebraic groups are the only examples I am aware of.) – Misha Jul 10 '13 at 15:30
@Misha: there are Muranov's construction of boundedly generated infinite f.g. groups that are simple. – YCor Jul 10 '13 at 15:42

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.