Timeline for Size of an abelian permutation group with generators of order 2 [closed]
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 29, 2011 at 2:12 | comment | added | S. Carnahan♦ | I think math.stackexchange.com is a better home for your question. | |
| Aug 29, 2011 at 2:11 | history | closed |
user9198 Andreas Blass Felipe Voloch Gerry Myerson S. Carnahan♦ |
off topic | |
| Aug 29, 2011 at 1:21 | comment | added | Andreas Blass |
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.)
|
|
| Aug 28, 2011 at 23:12 | comment | added | Steve | You are right, it didn't make much sense. I've uptaded the question. | |
| Aug 28, 2011 at 23:12 | history | edited | Steve | CC BY-SA 3.0 |
deleted 66 characters in body; deleted 1 characters in body
|
| Aug 28, 2011 at 22:53 | comment | added | Daniel Mehkeri | 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? | |
| Aug 28, 2011 at 22:42 | comment | added | Steve | It's the set of points on which G is acting. I've updated the question to make it clearer. | |
| Aug 28, 2011 at 22:41 | history | edited | Steve | CC BY-SA 3.0 |
deleted 1 characters in body; deleted 68 characters in body; edited title
|
| Aug 28, 2011 at 22:31 | comment | added | user6976 | What is $\Omega$? | |
| Aug 28, 2011 at 22:09 | history | asked | Steve | CC BY-SA 3.0 |