Nomenclature for descending and ascending sets defined by a permutation
I have a question mostly about nomenclature.
Let $pi: mathbb{N} to mathbb{N}$ be a permutation of the natural numbers. For $x in mathbb{N}$, I have studied the sets
$ S_x = left{ x' in mathbb{N}| x' < x + frac{1}{2} , pi(x') > x + frac{1}{2} right} , \
T_x = left{ x' in mathbb{N} | x' > x + frac{1}{2} , pi(x') < x + frac{1}{2} right}$
where the permution ascends above $x$ in for the elements in $S_x$, and descends below $x$ for the elements in $T_x$.
My questions are:
1) Do the sets $S_x, T_x$ have a name in math literature? Are there any books or articles with results about them? (Obviously, $# S_x = # T_x$, but anything more interesting?)
2) I need a symbol for $pi( S_x)$ and $pi(T_x)$, what should I use? I lean towards $S_x^* := pi( T_x )$ and $T_x^* := pi( S_x )$.
permutations
New contributor
add a comment |
I have a question mostly about nomenclature.
Let $pi: mathbb{N} to mathbb{N}$ be a permutation of the natural numbers. For $x in mathbb{N}$, I have studied the sets
$ S_x = left{ x' in mathbb{N}| x' < x + frac{1}{2} , pi(x') > x + frac{1}{2} right} , \
T_x = left{ x' in mathbb{N} | x' > x + frac{1}{2} , pi(x') < x + frac{1}{2} right}$
where the permution ascends above $x$ in for the elements in $S_x$, and descends below $x$ for the elements in $T_x$.
My questions are:
1) Do the sets $S_x, T_x$ have a name in math literature? Are there any books or articles with results about them? (Obviously, $# S_x = # T_x$, but anything more interesting?)
2) I need a symbol for $pi( S_x)$ and $pi(T_x)$, what should I use? I lean towards $S_x^* := pi( T_x )$ and $T_x^* := pi( S_x )$.
permutations
New contributor
add a comment |
I have a question mostly about nomenclature.
Let $pi: mathbb{N} to mathbb{N}$ be a permutation of the natural numbers. For $x in mathbb{N}$, I have studied the sets
$ S_x = left{ x' in mathbb{N}| x' < x + frac{1}{2} , pi(x') > x + frac{1}{2} right} , \
T_x = left{ x' in mathbb{N} | x' > x + frac{1}{2} , pi(x') < x + frac{1}{2} right}$
where the permution ascends above $x$ in for the elements in $S_x$, and descends below $x$ for the elements in $T_x$.
My questions are:
1) Do the sets $S_x, T_x$ have a name in math literature? Are there any books or articles with results about them? (Obviously, $# S_x = # T_x$, but anything more interesting?)
2) I need a symbol for $pi( S_x)$ and $pi(T_x)$, what should I use? I lean towards $S_x^* := pi( T_x )$ and $T_x^* := pi( S_x )$.
permutations
New contributor
I have a question mostly about nomenclature.
Let $pi: mathbb{N} to mathbb{N}$ be a permutation of the natural numbers. For $x in mathbb{N}$, I have studied the sets
$ S_x = left{ x' in mathbb{N}| x' < x + frac{1}{2} , pi(x') > x + frac{1}{2} right} , \
T_x = left{ x' in mathbb{N} | x' > x + frac{1}{2} , pi(x') < x + frac{1}{2} right}$
where the permution ascends above $x$ in for the elements in $S_x$, and descends below $x$ for the elements in $T_x$.
My questions are:
1) Do the sets $S_x, T_x$ have a name in math literature? Are there any books or articles with results about them? (Obviously, $# S_x = # T_x$, but anything more interesting?)
2) I need a symbol for $pi( S_x)$ and $pi(T_x)$, what should I use? I lean towards $S_x^* := pi( T_x )$ and $T_x^* := pi( S_x )$.
permutations
permutations
New contributor
New contributor
New contributor
asked yesterday
JAskgaard
1015
1015
New contributor
New contributor
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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
});
}
});
JAskgaard is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3062064%2fnomenclature-for-descending-and-ascending-sets-defined-by-a-permutation%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
JAskgaard is a new contributor. Be nice, and check out our Code of Conduct.
JAskgaard is a new contributor. Be nice, and check out our Code of Conduct.
JAskgaard is a new contributor. Be nice, and check out our Code of Conduct.
JAskgaard is a new contributor. Be nice, and check out our Code of Conduct.
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3062064%2fnomenclature-for-descending-and-ascending-sets-defined-by-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