1
$\begingroup$

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$?

Improve this question
$\endgroup$
6
  • $\begingroup$ What is $\Omega$? $\endgroup$
    – user6976
    Commented Aug 28, 2011 at 22:31
  • $\begingroup$ It's the set of points on which G is acting. I've updated the question to make it clearer. $\endgroup$
    – Steve
    Commented Aug 28, 2011 at 22:42
  • 1
    $\begingroup$ 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? $\endgroup$
    – Daniel Mehkeri
    Commented Aug 28, 2011 at 22:53
  • $\begingroup$ You are right, it didn't make much sense. I've uptaded the question. $\endgroup$
    – Steve
    Commented Aug 28, 2011 at 23:12
  • $\begingroup$ 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.) $\endgroup$
    – Andreas Blass
    Commented Aug 29, 2011 at 1:21

0

Reset to default

Browse other questions tagged .