MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

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

Let $g_1, \ldots, g_k$ be distinct permutations on a set $\Omega$. Suppose that $G = \langle g_1, \ldots, g_k \rangle$ is an abelian permutation group with only elements of order at most 2. Is it possible that $|G| = k$? If not, can $|G|$ be polynomial in $k$?

share|cite|improve this question

closed as off topic by Alex Bartel, Andreas Blass, Felipe Voloch, Gerry Myerson, S. Carnahan Aug 29 '11 at 2:11

Questions on MathOverflow are expected to relate to research level mathematics within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here.If this question can be reworded to fit the rules in the help center, please edit the question.

What is $\Omega$? – Mark Sapir Aug 28 '11 at 22:31
It's the set of points on which G is acting. I've updated the question to make it clearer. – Steve Aug 28 '11 at 22:42
Why not $k=n$, all the distinct elements of $G$? If you mean that no proper subset of $\langle g_1 \cdots g_k$ generates $G$ then $n = 2^k$ no? If you mean something else what? – Daniel Mehkeri Aug 28 '11 at 22:53
You are right, it didn't make much sense. I've uptaded the question. – Steve Aug 28 '11 at 23:12
Assuming $k$ is fixed, the possibilities for $|G|$ are all the powers of 2 in the range $k\leq |G|\leq 2^k$. (This might or might not answer the question, depending on what the question actually is.) – Andreas Blass Aug 29 '11 at 1:21