14
$\begingroup$

Does every countable, infinite, amenable, periodic group $G$ contain an infinite locally finite subgroup?

Remarks:

  1. I would be happy with an infinitely generated counterexample as long as it is countable.

  2. A counterexample cannot be elementary amenable, as elementary amenable periodic groups are locally finite.

  3. First Grigorchuk's group is not a counterexample: it is a 2-group, and hence it contains an infinite abelian group (by a result of Held, "On abelian subgroups of infinite 2-groups").

  4. Amenability of $G$ is essential, due to existence of Tarski monsters whose subgroups are finite cyclic (constructed by Olshanskii).

  5. Any infinite locally finite group contains an infinite abelian subgroup (see a paper of Hall-Kulatilaka here, so it is equivalent to ask whether $G$ contains an infinite abelian subgroup.

  6. This question was asked here in 2008, so perhaps it is an open problem.

$\endgroup$
3
  • 3
    $\begingroup$ certainly (1) does not help: indeed if your group is not locally finite, it contains an infinite f.g. subgroup and hence this subgroup also satisfies your requirements. $\endgroup$
    – YCor
    Commented Jun 1, 2012 at 17:14
  • $\begingroup$ As far as I remember, Grigorchuk also constructs f.g. $p$-groups for $p \neq 2$ of intermediate growth. Could these serve as counterexamples? $\endgroup$ Commented Jun 1, 2012 at 18:42
  • $\begingroup$ @Yves, thank you. @Ashot, I do not know the literature, which is why I ask here; there are of course other periodic amenable groups. $\endgroup$ Commented Jun 1, 2012 at 19:10

2 Answers 2

6
$\begingroup$

@Ashot, Grigorchuk $p$-groups are branch, so one can easily construct infinite abelian subgroups as well. As generators one can just take elements from rigid stabilizers of different vertices, such that none of these vertices is a prefix of the other. So these groups don't provide counterexamples.

$\endgroup$
4
  • $\begingroup$ I meant adding this as a comment, but couldn't find the link to do it. $\endgroup$ Commented Jun 2, 2012 at 12:05
  • $\begingroup$ @Dima: I think, you need reputation $\ge 50$ to comment. $\endgroup$
    – Misha
    Commented Jun 2, 2012 at 13:08
  • $\begingroup$ @Dima: thank you, and welcome to mathoverflow. I think you can leave comments only after you earn enough reputation points; not sure how many is needed. $\endgroup$ Commented Jun 2, 2012 at 13:08
  • $\begingroup$ @Dima: thanks for your comment. This gives an argument that does not involve Held's theorem. $\endgroup$ Commented Jun 4, 2012 at 13:52
0
$\begingroup$

I think one possible approach to answer your question would be the paper. In this paper, we showed that a discrete group $G$ is locally finite if and only if every possible system of configuration equations admits a strictly positive solution. Also, we gave a procedure to get equidecomposable subsets $𝐴$ and $𝐵$ of an infinite finitely generated or a locally finite group 𝐺 such that $A$ is a pure subset of $B$, directly from a system of configuration equations not having a strictly positive solution.

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .