Timeline for Discrete subgroups of products of SU(2)
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 20, 2013 at 21:39 | comment | added | José Figueroa-O'Farrill | As I said, this is a serious undertaking for the reasons you have mentioned. I cannot say whether it's "sensible" spending time on this. I suppose it would depend on what you plan to use this for. | |
| Aug 20, 2013 at 15:53 | comment | added | user38651 | - sorry for the typos, I wish I could edit comments - | |
| Aug 20, 2013 at 13:46 | comment | added | user38651 | The second problem I see is that the amount of members in the list would increase vastly! - I wouldn't say douplet, but rather exponentially- . And after that I in fact have to do something else with those ... Do you think it is sort of sensible investing time on this ? | |
| Aug 20, 2013 at 13:43 | comment | added | user38651 | Ok, so I think I have understood the general ideas in your paper. Theoretically it should be extendable for three factors and the main difficulty would be in discriminating all possible compatible pairs $(A,B)\subset S^3 \times (S^3)^2$. The first problem is more concerning the subgroups of a fiber product - In fact I don't see how you identified this twisted fiber products, for instance of cyclic gropus with the product of cyclic groups, even less in the case of bynary polyhedral groups - | |
| Aug 16, 2013 at 16:17 | comment | added | José Figueroa-O'Farrill | Sorry, but I'm not sure what you mean by table. It may be beneficial to read the introductory section "How to use this paper". There you will read that Tables 8, 9 and 10 contain the desired subgroups, written as twisted products, which is how they are described using Goursat lemma. | |
| Aug 16, 2013 at 12:29 | comment | added | user38651 | Ok, thank's for the quick answer. I will try use the approach to classify all the subgroups SU(2)×SU(2)×SU(2). | |
| Aug 15, 2013 at 20:19 | history | answered | José Figueroa-O'Farrill | CC BY-SA 3.0 |