To whom is interested https://github.com/joskoot/restricted-permutations
A module that represents permutations by bijections, id est, by functions. Documentation (scribble) is included. Care has been taken such that two permutations representing the same mathemathical permutation are the same in the sense of [eq?]. Finite groups of restricted permutations are the same in the sense of [eq?] too. Much depends on exactness of numbers, which in many languages does not exist. Therefore Racket seems a nice vehicle to me. Criticism is welcome, of course. Jos PS: I am working on an exact representation of the values of nj-symbols and Clebsch-Gordon coefficients, but this is about infinite groups of symmetries in O3. Before going to O8, I have to study more. -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
