How does a permutation act on a string?Permutation of a groupFinding a permutation, and number of, from powers of the permutationShowing that there is a permutation $rho$ that fixes a number that $sigma$ moves when $rho sigma rho^-1=sigma^-1$Permutation of composition factors?Blocks in permutation group theory (D&F)Establishing a bijection between permutations and permutation matrices.Finding the smallest exponent $k$ for a non-cyclic permutation $sigma$, so that $sigma^k = id$.What is the following way of indexing permutations called?Mth position of the Nth Ordered permutation of an ordrered set all elements taken at onceSymmetries of the Tetrahedron - Geometric description and isomorphic correlations
How to handle professionally if colleagues has referred his relative and asking to take easy while taking interview
I recently started my machine learning PhD and I have absolutely no idea what I'm doing
How does a permutation act on a string?
My bread in my bread maker rises and then falls down just after cooking starts
Polynomial division: Is this trick obvious?
Why when I add jam to my tea it stops producing thin "membrane" on top?
Can anyone give me examples of the relative-determinative 'which'?
What is the status of the Lannisters after Season 8 Episode 5, "The Bells"?
What do the "optional" resistor and capacitor do in this circuit?
Testing if os.path.exists with ArcPy?
How to continually let my readers know what time it is in my story, in an organic way?
Understanding Deutch's Algorithm
Why did Varys remove his rings?
Windows 10 lock screen - display my own random images
Do high-wing aircraft represent more difficult engineering challenges than low-wing aircraft?
Which creature is depicted in this Xanathar's Guide illustration of a war mage?
How does Ctrl+c and Ctrl+v work?
labelled end points on logic diagram
How would you translate "grit" (personality trait) to Chinese?
Why did the metro bus stop at each railway crossing, despite no warning indicating a train was coming?
Why are lawsuits between the President and Congress not automatically sent to the Supreme Court
Is there any good reason to write "it is easy to see"?
What is this weird d12 for?
Does the wearer know what items are in which patch in the Robe of Useful items?
How does a permutation act on a string?
Permutation of a groupFinding a permutation, and number of, from powers of the permutationShowing that there is a permutation $rho$ that fixes a number that $sigma$ moves when $rho sigma rho^-1=sigma^-1$Permutation of composition factors?Blocks in permutation group theory (D&F)Establishing a bijection between permutations and permutation matrices.Finding the smallest exponent $k$ for a non-cyclic permutation $sigma$, so that $sigma^k = id$.What is the following way of indexing permutations called?Mth position of the Nth Ordered permutation of an ordrered set all elements taken at onceSymmetries of the Tetrahedron - Geometric description and isomorphic correlations
$begingroup$
Is there a conventional way to have a permutation act on a list of objects? It seems like there are two possible ways, one being the inverse of the other.
Suppose I have a permutation $sigma in S_4$ which is concretely specified as a function from the set $S = 1,2,3,4$ to itself. Specifically,
$$beginarraycccc
i & 1 & 2 & 3 & 4 \ hline
sigma(i) & 4 & 3 & 1 & 2
endarray$$
Say I want to permute the string "STAR" by $sigma$. One way to do it would be to send the letter at position $i$ to position $sigma(i)$ in the result, giving "ARTS". Another way to do it would be to populate the $i^textth$ entry of the result using the $sigma(i)^textth$ entry of the original. That would give "RAST".
The first one seems more correct, but the second is more appealing because the string "1234" permutes to "4312", which you read directly off the table.
EDIT: I realize this is equivalent to asking if a permutation matrix should have ones in entries $a_i,sigma(i)$ or $a_sigma(i),i$.
permutations
$endgroup$
add a comment |
$begingroup$
Is there a conventional way to have a permutation act on a list of objects? It seems like there are two possible ways, one being the inverse of the other.
Suppose I have a permutation $sigma in S_4$ which is concretely specified as a function from the set $S = 1,2,3,4$ to itself. Specifically,
$$beginarraycccc
i & 1 & 2 & 3 & 4 \ hline
sigma(i) & 4 & 3 & 1 & 2
endarray$$
Say I want to permute the string "STAR" by $sigma$. One way to do it would be to send the letter at position $i$ to position $sigma(i)$ in the result, giving "ARTS". Another way to do it would be to populate the $i^textth$ entry of the result using the $sigma(i)^textth$ entry of the original. That would give "RAST".
The first one seems more correct, but the second is more appealing because the string "1234" permutes to "4312", which you read directly off the table.
EDIT: I realize this is equivalent to asking if a permutation matrix should have ones in entries $a_i,sigma(i)$ or $a_sigma(i),i$.
permutations
$endgroup$
$begingroup$
For each $iin S$, $i$ should go to $sigma(i)$. Since the characters in the string are usually mapped to their indices, a permutation of the string is a permutation on its index set. Therefore, I would say your first way is correct.
$endgroup$
– John Douma
3 hours ago
2
$begingroup$
Both are correct: one is a left action and the other is a right action.
$endgroup$
– Catalin Zara
2 hours ago
$begingroup$
@CatalinZara could you expand this into an answer?
$endgroup$
– Q the Platypus
1 hour ago
add a comment |
$begingroup$
Is there a conventional way to have a permutation act on a list of objects? It seems like there are two possible ways, one being the inverse of the other.
Suppose I have a permutation $sigma in S_4$ which is concretely specified as a function from the set $S = 1,2,3,4$ to itself. Specifically,
$$beginarraycccc
i & 1 & 2 & 3 & 4 \ hline
sigma(i) & 4 & 3 & 1 & 2
endarray$$
Say I want to permute the string "STAR" by $sigma$. One way to do it would be to send the letter at position $i$ to position $sigma(i)$ in the result, giving "ARTS". Another way to do it would be to populate the $i^textth$ entry of the result using the $sigma(i)^textth$ entry of the original. That would give "RAST".
The first one seems more correct, but the second is more appealing because the string "1234" permutes to "4312", which you read directly off the table.
EDIT: I realize this is equivalent to asking if a permutation matrix should have ones in entries $a_i,sigma(i)$ or $a_sigma(i),i$.
permutations
$endgroup$
Is there a conventional way to have a permutation act on a list of objects? It seems like there are two possible ways, one being the inverse of the other.
Suppose I have a permutation $sigma in S_4$ which is concretely specified as a function from the set $S = 1,2,3,4$ to itself. Specifically,
$$beginarraycccc
i & 1 & 2 & 3 & 4 \ hline
sigma(i) & 4 & 3 & 1 & 2
endarray$$
Say I want to permute the string "STAR" by $sigma$. One way to do it would be to send the letter at position $i$ to position $sigma(i)$ in the result, giving "ARTS". Another way to do it would be to populate the $i^textth$ entry of the result using the $sigma(i)^textth$ entry of the original. That would give "RAST".
The first one seems more correct, but the second is more appealing because the string "1234" permutes to "4312", which you read directly off the table.
EDIT: I realize this is equivalent to asking if a permutation matrix should have ones in entries $a_i,sigma(i)$ or $a_sigma(i),i$.
permutations
permutations
edited 3 hours ago
orlandpm
asked 3 hours ago
orlandpmorlandpm
4,79422038
4,79422038
$begingroup$
For each $iin S$, $i$ should go to $sigma(i)$. Since the characters in the string are usually mapped to their indices, a permutation of the string is a permutation on its index set. Therefore, I would say your first way is correct.
$endgroup$
– John Douma
3 hours ago
2
$begingroup$
Both are correct: one is a left action and the other is a right action.
$endgroup$
– Catalin Zara
2 hours ago
$begingroup$
@CatalinZara could you expand this into an answer?
$endgroup$
– Q the Platypus
1 hour ago
add a comment |
$begingroup$
For each $iin S$, $i$ should go to $sigma(i)$. Since the characters in the string are usually mapped to their indices, a permutation of the string is a permutation on its index set. Therefore, I would say your first way is correct.
$endgroup$
– John Douma
3 hours ago
2
$begingroup$
Both are correct: one is a left action and the other is a right action.
$endgroup$
– Catalin Zara
2 hours ago
$begingroup$
@CatalinZara could you expand this into an answer?
$endgroup$
– Q the Platypus
1 hour ago
$begingroup$
For each $iin S$, $i$ should go to $sigma(i)$. Since the characters in the string are usually mapped to their indices, a permutation of the string is a permutation on its index set. Therefore, I would say your first way is correct.
$endgroup$
– John Douma
3 hours ago
$begingroup$
For each $iin S$, $i$ should go to $sigma(i)$. Since the characters in the string are usually mapped to their indices, a permutation of the string is a permutation on its index set. Therefore, I would say your first way is correct.
$endgroup$
– John Douma
3 hours ago
2
2
$begingroup$
Both are correct: one is a left action and the other is a right action.
$endgroup$
– Catalin Zara
2 hours ago
$begingroup$
Both are correct: one is a left action and the other is a right action.
$endgroup$
– Catalin Zara
2 hours ago
$begingroup$
@CatalinZara could you expand this into an answer?
$endgroup$
– Q the Platypus
1 hour ago
$begingroup$
@CatalinZara could you expand this into an answer?
$endgroup$
– Q the Platypus
1 hour ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Both actions are correct: one is a left action and the other is a right action.
[See https://en.wikipedia.org/wiki/Group_action_(mathematics)]
For the first action: to a permutation $sigma$ and a string $x$, we associate a string $sigma cdot x$, defined by $(sigma cdot x)_sigma(i) = x_i$ ("letter at position $i$ is sent to position $sigma(i)$"), for all indices $i$ or, equivalently, $(sigma cdot x)_j = x_sigma^-1(j)$ for all indices $j$. That is a left action, since for two permutations $sigma$ and $tau$, we have
$$[sigmacdot (taucdot x))]_i = (taucdot x)_sigma^-1(i) = x_tau^-1(sigma^-1(i))= x_(sigmatau)^-1(i) = [(sigma tau)cdot x]_i,$$
hence
$$sigmacdot (taucdot x) = (sigma tau)cdot x.$$
Applying (i.e. "multiplying" by) $tau$ and then $sigma$ is the same as applying $sigmatau$. That is how multiplication to the left works, hence the term ''left action.''
For the second action: to a permutation $sigma$ and a string $x$, we associate a string $xstar sigma$, defined by $(xstar sigma)_i = x_sigma(i)$ ("$i^th$ entry of the result is the $sigma(i)^th$ entry of the original."). That is a right action, since for two permutations $sigma$ and $tau$, we have
$$[(xstar sigma)star tau]_i = [xstarsigma]_tau(i)= x_sigma(tau(i)) = x_(sigmatau)(i) = [xstar (sigmatau)]_i,$$
hence
$$(xstar sigma)star tau = xstar(sigmatau).$$
Applying (i.e. "multiplying" by) $sigma$ and then $tau$ is the same as applying $sigmatau$. That is how multiplication to the right works, hence the term ''right action.''
The two actions are indeed related by
$$(sigma cdot x)star sigma = x = sigma cdot (xstar sigma),$$
because
$$xstar sigma = sigma^-1cdot x.$$
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
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%2f3226327%2fhow-does-a-permutation-act-on-a-string%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Both actions are correct: one is a left action and the other is a right action.
[See https://en.wikipedia.org/wiki/Group_action_(mathematics)]
For the first action: to a permutation $sigma$ and a string $x$, we associate a string $sigma cdot x$, defined by $(sigma cdot x)_sigma(i) = x_i$ ("letter at position $i$ is sent to position $sigma(i)$"), for all indices $i$ or, equivalently, $(sigma cdot x)_j = x_sigma^-1(j)$ for all indices $j$. That is a left action, since for two permutations $sigma$ and $tau$, we have
$$[sigmacdot (taucdot x))]_i = (taucdot x)_sigma^-1(i) = x_tau^-1(sigma^-1(i))= x_(sigmatau)^-1(i) = [(sigma tau)cdot x]_i,$$
hence
$$sigmacdot (taucdot x) = (sigma tau)cdot x.$$
Applying (i.e. "multiplying" by) $tau$ and then $sigma$ is the same as applying $sigmatau$. That is how multiplication to the left works, hence the term ''left action.''
For the second action: to a permutation $sigma$ and a string $x$, we associate a string $xstar sigma$, defined by $(xstar sigma)_i = x_sigma(i)$ ("$i^th$ entry of the result is the $sigma(i)^th$ entry of the original."). That is a right action, since for two permutations $sigma$ and $tau$, we have
$$[(xstar sigma)star tau]_i = [xstarsigma]_tau(i)= x_sigma(tau(i)) = x_(sigmatau)(i) = [xstar (sigmatau)]_i,$$
hence
$$(xstar sigma)star tau = xstar(sigmatau).$$
Applying (i.e. "multiplying" by) $sigma$ and then $tau$ is the same as applying $sigmatau$. That is how multiplication to the right works, hence the term ''right action.''
The two actions are indeed related by
$$(sigma cdot x)star sigma = x = sigma cdot (xstar sigma),$$
because
$$xstar sigma = sigma^-1cdot x.$$
$endgroup$
add a comment |
$begingroup$
Both actions are correct: one is a left action and the other is a right action.
[See https://en.wikipedia.org/wiki/Group_action_(mathematics)]
For the first action: to a permutation $sigma$ and a string $x$, we associate a string $sigma cdot x$, defined by $(sigma cdot x)_sigma(i) = x_i$ ("letter at position $i$ is sent to position $sigma(i)$"), for all indices $i$ or, equivalently, $(sigma cdot x)_j = x_sigma^-1(j)$ for all indices $j$. That is a left action, since for two permutations $sigma$ and $tau$, we have
$$[sigmacdot (taucdot x))]_i = (taucdot x)_sigma^-1(i) = x_tau^-1(sigma^-1(i))= x_(sigmatau)^-1(i) = [(sigma tau)cdot x]_i,$$
hence
$$sigmacdot (taucdot x) = (sigma tau)cdot x.$$
Applying (i.e. "multiplying" by) $tau$ and then $sigma$ is the same as applying $sigmatau$. That is how multiplication to the left works, hence the term ''left action.''
For the second action: to a permutation $sigma$ and a string $x$, we associate a string $xstar sigma$, defined by $(xstar sigma)_i = x_sigma(i)$ ("$i^th$ entry of the result is the $sigma(i)^th$ entry of the original."). That is a right action, since for two permutations $sigma$ and $tau$, we have
$$[(xstar sigma)star tau]_i = [xstarsigma]_tau(i)= x_sigma(tau(i)) = x_(sigmatau)(i) = [xstar (sigmatau)]_i,$$
hence
$$(xstar sigma)star tau = xstar(sigmatau).$$
Applying (i.e. "multiplying" by) $sigma$ and then $tau$ is the same as applying $sigmatau$. That is how multiplication to the right works, hence the term ''right action.''
The two actions are indeed related by
$$(sigma cdot x)star sigma = x = sigma cdot (xstar sigma),$$
because
$$xstar sigma = sigma^-1cdot x.$$
$endgroup$
add a comment |
$begingroup$
Both actions are correct: one is a left action and the other is a right action.
[See https://en.wikipedia.org/wiki/Group_action_(mathematics)]
For the first action: to a permutation $sigma$ and a string $x$, we associate a string $sigma cdot x$, defined by $(sigma cdot x)_sigma(i) = x_i$ ("letter at position $i$ is sent to position $sigma(i)$"), for all indices $i$ or, equivalently, $(sigma cdot x)_j = x_sigma^-1(j)$ for all indices $j$. That is a left action, since for two permutations $sigma$ and $tau$, we have
$$[sigmacdot (taucdot x))]_i = (taucdot x)_sigma^-1(i) = x_tau^-1(sigma^-1(i))= x_(sigmatau)^-1(i) = [(sigma tau)cdot x]_i,$$
hence
$$sigmacdot (taucdot x) = (sigma tau)cdot x.$$
Applying (i.e. "multiplying" by) $tau$ and then $sigma$ is the same as applying $sigmatau$. That is how multiplication to the left works, hence the term ''left action.''
For the second action: to a permutation $sigma$ and a string $x$, we associate a string $xstar sigma$, defined by $(xstar sigma)_i = x_sigma(i)$ ("$i^th$ entry of the result is the $sigma(i)^th$ entry of the original."). That is a right action, since for two permutations $sigma$ and $tau$, we have
$$[(xstar sigma)star tau]_i = [xstarsigma]_tau(i)= x_sigma(tau(i)) = x_(sigmatau)(i) = [xstar (sigmatau)]_i,$$
hence
$$(xstar sigma)star tau = xstar(sigmatau).$$
Applying (i.e. "multiplying" by) $sigma$ and then $tau$ is the same as applying $sigmatau$. That is how multiplication to the right works, hence the term ''right action.''
The two actions are indeed related by
$$(sigma cdot x)star sigma = x = sigma cdot (xstar sigma),$$
because
$$xstar sigma = sigma^-1cdot x.$$
$endgroup$
Both actions are correct: one is a left action and the other is a right action.
[See https://en.wikipedia.org/wiki/Group_action_(mathematics)]
For the first action: to a permutation $sigma$ and a string $x$, we associate a string $sigma cdot x$, defined by $(sigma cdot x)_sigma(i) = x_i$ ("letter at position $i$ is sent to position $sigma(i)$"), for all indices $i$ or, equivalently, $(sigma cdot x)_j = x_sigma^-1(j)$ for all indices $j$. That is a left action, since for two permutations $sigma$ and $tau$, we have
$$[sigmacdot (taucdot x))]_i = (taucdot x)_sigma^-1(i) = x_tau^-1(sigma^-1(i))= x_(sigmatau)^-1(i) = [(sigma tau)cdot x]_i,$$
hence
$$sigmacdot (taucdot x) = (sigma tau)cdot x.$$
Applying (i.e. "multiplying" by) $tau$ and then $sigma$ is the same as applying $sigmatau$. That is how multiplication to the left works, hence the term ''left action.''
For the second action: to a permutation $sigma$ and a string $x$, we associate a string $xstar sigma$, defined by $(xstar sigma)_i = x_sigma(i)$ ("$i^th$ entry of the result is the $sigma(i)^th$ entry of the original."). That is a right action, since for two permutations $sigma$ and $tau$, we have
$$[(xstar sigma)star tau]_i = [xstarsigma]_tau(i)= x_sigma(tau(i)) = x_(sigmatau)(i) = [xstar (sigmatau)]_i,$$
hence
$$(xstar sigma)star tau = xstar(sigmatau).$$
Applying (i.e. "multiplying" by) $sigma$ and then $tau$ is the same as applying $sigmatau$. That is how multiplication to the right works, hence the term ''right action.''
The two actions are indeed related by
$$(sigma cdot x)star sigma = x = sigma cdot (xstar sigma),$$
because
$$xstar sigma = sigma^-1cdot x.$$
edited 5 mins ago
answered 44 mins ago
Catalin ZaraCatalin Zara
3,932514
3,932514
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
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%2f3226327%2fhow-does-a-permutation-act-on-a-string%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
$begingroup$
For each $iin S$, $i$ should go to $sigma(i)$. Since the characters in the string are usually mapped to their indices, a permutation of the string is a permutation on its index set. Therefore, I would say your first way is correct.
$endgroup$
– John Douma
3 hours ago
2
$begingroup$
Both are correct: one is a left action and the other is a right action.
$endgroup$
– Catalin Zara
2 hours ago
$begingroup$
@CatalinZara could you expand this into an answer?
$endgroup$
– Q the Platypus
1 hour ago