Timeline for How to efficiently generate a wreath product?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 30, 2011 at 5:07 | vote | accept | CommunityBot | ||
| Aug 30, 2011 at 4:55 | comment | added | user17474 | Oh, and I'm generating $bij(A, B)$ from $bij(A,B) = g \circ bij(A, A)$ for any $g \in bij(A, B)$. | |
| Aug 30, 2011 at 4:53 | comment | added | user17474 | @Mark: I'm probably abusing the word "efficiency" sorry, I'm trying to write functions for the equivalence ((simple), ordinal or cardinal) of normal form games for a library I have, one way I can think of is to iterate through the set of bijections (which are a lot like a wreath product) to test whether they meet the conditions for an isomorphism, so I'm trying to generate the set of bijections without doing more work than needed. Semi direct products do appear to be what I really want, I'll play around with that and see where I get, thanks! | |
| Aug 30, 2011 at 4:51 | answer | added | Dikran Karagueuzian | timeline score: 3 | |
| Aug 30, 2011 at 4:44 | comment | added | user6976 | @Nick: About 1. and 2. - these are standard properties of semidirect products, see Wiki. I still do not understand what "efficiently" means (and I am not sure you understand it either). | |
| Aug 30, 2011 at 4:40 | history | edited | user17474 | CC BY-SA 3.0 |
added 25 characters in body; added 56 characters in body; added 4 characters in body
|
| Aug 30, 2011 at 4:27 | history | edited | user17474 | CC BY-SA 3.0 |
added 107 characters in body; deleted 22 characters in body; edited body
|
| Aug 30, 2011 at 4:20 | history | edited | user17474 | CC BY-SA 3.0 |
added 773 characters in body
|
| Aug 30, 2011 at 3:59 | comment | added | user6976 | What do "distinctly" and "efficiently" mean? The group is not free. Also what is $\circ$? | |
| Aug 30, 2011 at 3:32 | history | asked | user17474 | CC BY-SA 3.0 |