18.83 (2014)

Open

A generating system $X$ of a group $G$ is fast if there is an integer $n$ such that every element of $G$ can be expressed as a product of at most $n$ elements of $X$ or their inverses. If not, we say that it is slow. For instance, in $(\mathbb{Z}, +)$, the squares are fast, but the powers of 2 are slow.
Do there exist countable infinite groups without an infinite slow generating set? Uncountable ones do exist.

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.