Thanks Robby and Vincent for the advice. Yes, I should have been more precise, I need to generate all *total preorders* of a given size. The task is equivalent to generating all weak orders.
I think my idea to do this on the basis of permutations is flawed and I'll start from scratch but it would be helpful if I could find a reference to an algorithm. Someone on stackoverflow gave me a working implementation in Python 3 https://stackoverflow.com/questions/32694444/ but it uses advanced features and I have no clue how to translate this to Racket. Best, Erich -- 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.
