How can I find the inverse of a permutation?
up vote
2
down vote
favorite
My question is, how can the inverse of $5 9 1 8 2 6 4 7 3$ be $3 5 9 7 1 6 8 4 2$? At first glance, 1 and 2 are both less than 3, for example, which seems to conflict with the instruction "then sorting the columns into increasing order". Is this not a total order over the natural numbers?
The reader should not confuse inversions of a permutation with the inverse of a permutation. Recall that we can write a permutation in two-line form
$$left(begin{matrix}
1 & 2 & 3 & cdots & n\
a_1 & a_2 & a_3 & cdots & a_n
end{matrix}right)$$
the inverse $a'^1a'^2a'^3 ... a'^n$ of this permutation is the permutation obtained by interchanging the two rows and then sorting the columns into increasing order of the new top row:
$$left(begin{matrix}
a_1 & a_2 & a_3 & cdots & n\
1 & 2 & 3 & cdots & n
end{matrix}right)=left(begin{matrix}
1 & 2 & 3 & cdots & n\
a'_1 & a'_2 & a'_3 & cdots & a'_n
end{matrix}right) $$
For example, the inverse of $5 9 1 8 2 6 4 7 3$ is $3 5 9 7 1 6 8 4 2$, since
$$left(begin{matrix}
5 & 9 & 1 & 8 & 2 & 6 & 4 & 7 & 3\
1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9
end{matrix}right)=left(begin{matrix}
1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9\
3 & 5 & 9 & 7 &1 & 6 & 8 & 4 & 2
end{matrix}right) $$
— Knuth, Donald. The Art of Computer Programming: Sorting and Searching. Vol. 3, Second Edition.
permutations inverse
add a comment |
up vote
2
down vote
favorite
My question is, how can the inverse of $5 9 1 8 2 6 4 7 3$ be $3 5 9 7 1 6 8 4 2$? At first glance, 1 and 2 are both less than 3, for example, which seems to conflict with the instruction "then sorting the columns into increasing order". Is this not a total order over the natural numbers?
The reader should not confuse inversions of a permutation with the inverse of a permutation. Recall that we can write a permutation in two-line form
$$left(begin{matrix}
1 & 2 & 3 & cdots & n\
a_1 & a_2 & a_3 & cdots & a_n
end{matrix}right)$$
the inverse $a'^1a'^2a'^3 ... a'^n$ of this permutation is the permutation obtained by interchanging the two rows and then sorting the columns into increasing order of the new top row:
$$left(begin{matrix}
a_1 & a_2 & a_3 & cdots & n\
1 & 2 & 3 & cdots & n
end{matrix}right)=left(begin{matrix}
1 & 2 & 3 & cdots & n\
a'_1 & a'_2 & a'_3 & cdots & a'_n
end{matrix}right) $$
For example, the inverse of $5 9 1 8 2 6 4 7 3$ is $3 5 9 7 1 6 8 4 2$, since
$$left(begin{matrix}
5 & 9 & 1 & 8 & 2 & 6 & 4 & 7 & 3\
1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9
end{matrix}right)=left(begin{matrix}
1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9\
3 & 5 & 9 & 7 &1 & 6 & 8 & 4 & 2
end{matrix}right) $$
— Knuth, Donald. The Art of Computer Programming: Sorting and Searching. Vol. 3, Second Edition.
permutations inverse
add a comment |
up vote
2
down vote
favorite
up vote
2
down vote
favorite
My question is, how can the inverse of $5 9 1 8 2 6 4 7 3$ be $3 5 9 7 1 6 8 4 2$? At first glance, 1 and 2 are both less than 3, for example, which seems to conflict with the instruction "then sorting the columns into increasing order". Is this not a total order over the natural numbers?
The reader should not confuse inversions of a permutation with the inverse of a permutation. Recall that we can write a permutation in two-line form
$$left(begin{matrix}
1 & 2 & 3 & cdots & n\
a_1 & a_2 & a_3 & cdots & a_n
end{matrix}right)$$
the inverse $a'^1a'^2a'^3 ... a'^n$ of this permutation is the permutation obtained by interchanging the two rows and then sorting the columns into increasing order of the new top row:
$$left(begin{matrix}
a_1 & a_2 & a_3 & cdots & n\
1 & 2 & 3 & cdots & n
end{matrix}right)=left(begin{matrix}
1 & 2 & 3 & cdots & n\
a'_1 & a'_2 & a'_3 & cdots & a'_n
end{matrix}right) $$
For example, the inverse of $5 9 1 8 2 6 4 7 3$ is $3 5 9 7 1 6 8 4 2$, since
$$left(begin{matrix}
5 & 9 & 1 & 8 & 2 & 6 & 4 & 7 & 3\
1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9
end{matrix}right)=left(begin{matrix}
1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9\
3 & 5 & 9 & 7 &1 & 6 & 8 & 4 & 2
end{matrix}right) $$
— Knuth, Donald. The Art of Computer Programming: Sorting and Searching. Vol. 3, Second Edition.
permutations inverse
My question is, how can the inverse of $5 9 1 8 2 6 4 7 3$ be $3 5 9 7 1 6 8 4 2$? At first glance, 1 and 2 are both less than 3, for example, which seems to conflict with the instruction "then sorting the columns into increasing order". Is this not a total order over the natural numbers?
The reader should not confuse inversions of a permutation with the inverse of a permutation. Recall that we can write a permutation in two-line form
$$left(begin{matrix}
1 & 2 & 3 & cdots & n\
a_1 & a_2 & a_3 & cdots & a_n
end{matrix}right)$$
the inverse $a'^1a'^2a'^3 ... a'^n$ of this permutation is the permutation obtained by interchanging the two rows and then sorting the columns into increasing order of the new top row:
$$left(begin{matrix}
a_1 & a_2 & a_3 & cdots & n\
1 & 2 & 3 & cdots & n
end{matrix}right)=left(begin{matrix}
1 & 2 & 3 & cdots & n\
a'_1 & a'_2 & a'_3 & cdots & a'_n
end{matrix}right) $$
For example, the inverse of $5 9 1 8 2 6 4 7 3$ is $3 5 9 7 1 6 8 4 2$, since
$$left(begin{matrix}
5 & 9 & 1 & 8 & 2 & 6 & 4 & 7 & 3\
1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9
end{matrix}right)=left(begin{matrix}
1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9\
3 & 5 & 9 & 7 &1 & 6 & 8 & 4 & 2
end{matrix}right) $$
— Knuth, Donald. The Art of Computer Programming: Sorting and Searching. Vol. 3, Second Edition.
permutations inverse
permutations inverse
asked 23 hours ago
Jonathan Komar
1287
1287
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
up vote
2
down vote
accepted
The last step is to sort the columns $jchoose i_j$ in increasing order such that the column $1choose i_1$ comes first, then comes $2choose i_2$ and so on. Indeed, the wording is a bit misleading. The column $jchoose i_j$ stands for the assignment $jmapsto i_j$ (here in the inverse permutation).
add a comment |
up vote
1
down vote
Given permutation is: 591826473
To get the inverse of this first write down the position of 1
It is in the 3rd position . SO inverse starts as "3 ...". Next locate 2 in the permutation. It is in the 5th position. So inverse expands to "52...." Similarl go on chasing 3,4 etc and note down their positions and build the inverse permutation.
I get how. I don‘t get the explanation in the quotation.
– Jonathan Komar
19 hours ago
I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
– P Vanchinathan
19 hours ago
I was of course referring to question contents. Wuestenfux addressed the issue from the book.
– Jonathan Komar
19 hours ago
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
accepted
The last step is to sort the columns $jchoose i_j$ in increasing order such that the column $1choose i_1$ comes first, then comes $2choose i_2$ and so on. Indeed, the wording is a bit misleading. The column $jchoose i_j$ stands for the assignment $jmapsto i_j$ (here in the inverse permutation).
add a comment |
up vote
2
down vote
accepted
The last step is to sort the columns $jchoose i_j$ in increasing order such that the column $1choose i_1$ comes first, then comes $2choose i_2$ and so on. Indeed, the wording is a bit misleading. The column $jchoose i_j$ stands for the assignment $jmapsto i_j$ (here in the inverse permutation).
add a comment |
up vote
2
down vote
accepted
up vote
2
down vote
accepted
The last step is to sort the columns $jchoose i_j$ in increasing order such that the column $1choose i_1$ comes first, then comes $2choose i_2$ and so on. Indeed, the wording is a bit misleading. The column $jchoose i_j$ stands for the assignment $jmapsto i_j$ (here in the inverse permutation).
The last step is to sort the columns $jchoose i_j$ in increasing order such that the column $1choose i_1$ comes first, then comes $2choose i_2$ and so on. Indeed, the wording is a bit misleading. The column $jchoose i_j$ stands for the assignment $jmapsto i_j$ (here in the inverse permutation).
edited 20 hours ago
answered 21 hours ago
Wuestenfux
2,2911410
2,2911410
add a comment |
add a comment |
up vote
1
down vote
Given permutation is: 591826473
To get the inverse of this first write down the position of 1
It is in the 3rd position . SO inverse starts as "3 ...". Next locate 2 in the permutation. It is in the 5th position. So inverse expands to "52...." Similarl go on chasing 3,4 etc and note down their positions and build the inverse permutation.
I get how. I don‘t get the explanation in the quotation.
– Jonathan Komar
19 hours ago
I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
– P Vanchinathan
19 hours ago
I was of course referring to question contents. Wuestenfux addressed the issue from the book.
– Jonathan Komar
19 hours ago
add a comment |
up vote
1
down vote
Given permutation is: 591826473
To get the inverse of this first write down the position of 1
It is in the 3rd position . SO inverse starts as "3 ...". Next locate 2 in the permutation. It is in the 5th position. So inverse expands to "52...." Similarl go on chasing 3,4 etc and note down their positions and build the inverse permutation.
I get how. I don‘t get the explanation in the quotation.
– Jonathan Komar
19 hours ago
I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
– P Vanchinathan
19 hours ago
I was of course referring to question contents. Wuestenfux addressed the issue from the book.
– Jonathan Komar
19 hours ago
add a comment |
up vote
1
down vote
up vote
1
down vote
Given permutation is: 591826473
To get the inverse of this first write down the position of 1
It is in the 3rd position . SO inverse starts as "3 ...". Next locate 2 in the permutation. It is in the 5th position. So inverse expands to "52...." Similarl go on chasing 3,4 etc and note down their positions and build the inverse permutation.
Given permutation is: 591826473
To get the inverse of this first write down the position of 1
It is in the 3rd position . SO inverse starts as "3 ...". Next locate 2 in the permutation. It is in the 5th position. So inverse expands to "52...." Similarl go on chasing 3,4 etc and note down their positions and build the inverse permutation.
answered 20 hours ago
P Vanchinathan
14.5k12036
14.5k12036
I get how. I don‘t get the explanation in the quotation.
– Jonathan Komar
19 hours ago
I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
– P Vanchinathan
19 hours ago
I was of course referring to question contents. Wuestenfux addressed the issue from the book.
– Jonathan Komar
19 hours ago
add a comment |
I get how. I don‘t get the explanation in the quotation.
– Jonathan Komar
19 hours ago
I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
– P Vanchinathan
19 hours ago
I was of course referring to question contents. Wuestenfux addressed the issue from the book.
– Jonathan Komar
19 hours ago
I get how. I don‘t get the explanation in the quotation.
– Jonathan Komar
19 hours ago
I get how. I don‘t get the explanation in the quotation.
– Jonathan Komar
19 hours ago
I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
– P Vanchinathan
19 hours ago
I haven't enclosed any words in quotations. Only the inverse permutation being built is shown in quotes. One at a time the inverse permutation is written.
– P Vanchinathan
19 hours ago
I was of course referring to question contents. Wuestenfux addressed the issue from the book.
– Jonathan Komar
19 hours ago
I was of course referring to question contents. Wuestenfux addressed the issue from the book.
– Jonathan Komar
19 hours ago
add a comment |
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2999320%2fhow-can-i-find-the-inverse-of-a-permutation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown