Wednesday, December 12, 2007

Permutations, Derivative Hierarchy

PERMUTATION GROUPS 1-4 – DERIVATIVE HIERARCHY

1
1 2
1 2 3
1 2 3 4
1 2 4 3
1 4 2 3
4 1 2 3
1 3 2
1 3 2 4
1 3 4 2
1 4 3 2
4 1 3 2
3 1 2
3 1 2 4
3 1 4 2
3 4 1 2
4 3 1 2
2 1
2 1 3
2 1 3 4
2 1 4 3
2 4 1 3
4 2 1 3
2 3 1
2 3 1 4
2 3 4 1
2 4 3 1
4 2 3 1
3 2 1
3 2 1 4
3 2 4 1
3 4 2 1
4 3 2 1

Does this have any important mathematical significance? Well, no, not really. Yes, it shows clearly why there are n! permutations of n, but you knew that already. So why bother with it? Because, think of this list, not of 1-4, but 1-infinity. Can you visualize it? It is infinite in a rather complex way.

3 Comments:

At 9:52 PM , Anonymous shonk said...

Cantor set?

 
At 12:08 AM , Blogger Bob said...

"I've gone cross eyed."--Austin Powers

 
At 5:38 PM , Blogger Wabulon said...

Dear shonk,

I don't think you can create an equivalent of the Cantor set that is discrete, as this is.

 

Post a Comment

<< Home