Why, I'm classifying codimension two hyperplane arrangements in C2. What else would I be doing?
Basically, I need to create all of the permutations of 1 to n, then for each one, apply a set of three rules which will give me a list of different permutations which shall be deemed "equivalent" to the current one. I give each of these a common tag and then move on.
I do perform quite a few lookups to determine whether I have already applied the set of rules to a particular permutation through one of its equivalent representations. This is important since each of the rules can give me many equivalent permutations.
At the end I perform one final clean up since sets of equivalent permutations may have been labeled with different tags. I make note of these occurrances during the first pass through though, so the final cleanup is trivial.
Thanks for asking! (but I bet you're sorry you did)
Dean
Update: Sorry, we're in C2 not C4
If we didn't reinvent the wheel, we wouldn't have rollerblades.
In reply to Re: Big Picture
by duelafn
in thread constructing large hashes
by duelafn
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |