Timeline for Graph Canonization & "set of isomorphism"
Current License: CC BY-SA 3.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 14, 2011 at 17:18 | comment | added | user15090 | Sorry that should have been: Then I would check to see if each of the normalized blocks in Design B are exactly the same as in Design A. | |
May 14, 2011 at 17:15 | comment | added | user15090 | Let's say one permutation relabeled element 1 with element 10 then Design B normalized would be: 134578 136789 234569 256789 1235810 1237910 1246810 1456910 2346710 4578910 Is this right? Then I would check to see if each of the normalized blocks in Design B are exactly the same as in Design B. The first block in Design B is 134578 but no corresponding block in Design A, therefore this permutation of Element 1 with Element 10 does not work. And this would be done for all the 3,628,800 permutations. IS THIS RIGHT??? I am trying to make sure I understand the mechanics of it! Thx | |
May 14, 2011 at 13:46 | vote | accept | user15090 | ||
May 14, 2011 at 13:46 | |||||
S May 14, 2011 at 13:46 | vote | accept | user15090 | ||
May 14, 2011 at 13:46 | |||||
May 14, 2011 at 13:45 | vote | accept | user15090 | ||
S May 14, 2011 at 13:46 | |||||
May 14, 2011 at 12:40 | answer | added | Gordon Royle | timeline score: 1 | |
May 14, 2011 at 6:25 | answer | added | Gerhard Paseman | timeline score: 0 | |
May 13, 2011 at 19:13 | comment | added | Andreas Blass | "Apply every possible permutation" means that for each of the 3,628,800 permutations of the set {1,2,3,...,10} (i.e., each one-to-oone mapping of this set onto itself) you should apply that function to every entry in your entire Design B. This is what's involved in the definition of isomorphism. Getting an algorithm that works reasonably fast on reasonably large designs is a more difficult matter. This is not a research-level question, so I'm voting to close. | |
May 13, 2011 at 19:04 | history | asked | user15090 | CC BY-SA 3.0 |