| Author |
Comment/Response |
lesobrod
|
 09/22/10 1:32pm
I'm back..sorry :)
My previous question was wrong defined.
Real problem is : in the set of lists delete possible permutations. Not only pairs! So from
{{1,2,3}, {3,2,1}, {4,3,1}, {2,2,3}, {2,3,1}}
I'd like to get
{{1,2,3}, {4,3,1}, {2,2,3}}.
This problem is difficult enough to me ,
especially avoiding Sort[] and Union[] as slow proc.
But I think it's interesting and general enough problem of combinatoric and sets theory.
URL: , |
|
