35 | | and getting all the others by applying the same permutations. Finally, if one is able to generate the permutations instead of listing them in the code, one could really write a small code: this is certainly possible, the problem is that we need exactly the same algo in Fortran (to run the code) and in Python (to write the code and make the identification of the jamp(i) with the corresponding element in the color matrix. |
| 35 | and getting all the others by applying the same permutations. |
| 36 | |
| 37 | Finally, if one is able to generate the permutations instead of listing them in the code, one could really write a small code: this is certainly possible (see attached file nexper.f for a fortran implementation), the problem is that we need exactly the same algo in Fortran (to run the code) and in Python (to write the code and make the identification of the jamp(i) with the corresponding element in the color matrix. |