Permutation with local maxima












3












$begingroup$


I'm trying solve this problem:



Permutation of numbers $1$ to $n$ has a local maximum on $j^{th}$ position if number on $j^{th}$ position is bigger than both its neighbours. For first and last number of a permutation, local maximum exists if that number is bigger than its only neighbour. Knowing that every of $n!$ permutations is equally expected, calculate expected number of local maxima.



I tried defining $X$ (variable) with $X_i$ equal to number of local maxima on $i^{th}$ position, but couldn't continue past that.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Putnam 2006-A4 See kskedlaya.org/putnam-archive/2006s.pdf
    $endgroup$
    – Catalin Zara
    Dec 28 '16 at 22:03










  • $begingroup$
    Hint: instead of counting by permutations (add the number of local maxima for each permutations), count by positions (add the number of permutations that have a local maximum at a specific position).
    $endgroup$
    – Catalin Zara
    Dec 28 '16 at 22:13












  • $begingroup$
    @CatalinZara The link that you provided answered my question and I'm very thankful for that. If you want you can post it as an answer so I can accept it.
    $endgroup$
    – Crabzmatic
    Dec 28 '16 at 22:27












  • $begingroup$
    I'm happy that you found an answer to your question, but I don't think providing a link really qualifies as an answer.
    $endgroup$
    – Catalin Zara
    Dec 28 '16 at 22:30










  • $begingroup$
    @CatalinZara You can always rewrite the answer from the link.
    $endgroup$
    – Crabzmatic
    Dec 28 '16 at 22:42
















3












$begingroup$


I'm trying solve this problem:



Permutation of numbers $1$ to $n$ has a local maximum on $j^{th}$ position if number on $j^{th}$ position is bigger than both its neighbours. For first and last number of a permutation, local maximum exists if that number is bigger than its only neighbour. Knowing that every of $n!$ permutations is equally expected, calculate expected number of local maxima.



I tried defining $X$ (variable) with $X_i$ equal to number of local maxima on $i^{th}$ position, but couldn't continue past that.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Putnam 2006-A4 See kskedlaya.org/putnam-archive/2006s.pdf
    $endgroup$
    – Catalin Zara
    Dec 28 '16 at 22:03










  • $begingroup$
    Hint: instead of counting by permutations (add the number of local maxima for each permutations), count by positions (add the number of permutations that have a local maximum at a specific position).
    $endgroup$
    – Catalin Zara
    Dec 28 '16 at 22:13












  • $begingroup$
    @CatalinZara The link that you provided answered my question and I'm very thankful for that. If you want you can post it as an answer so I can accept it.
    $endgroup$
    – Crabzmatic
    Dec 28 '16 at 22:27












  • $begingroup$
    I'm happy that you found an answer to your question, but I don't think providing a link really qualifies as an answer.
    $endgroup$
    – Catalin Zara
    Dec 28 '16 at 22:30










  • $begingroup$
    @CatalinZara You can always rewrite the answer from the link.
    $endgroup$
    – Crabzmatic
    Dec 28 '16 at 22:42














3












3








3


1



$begingroup$


I'm trying solve this problem:



Permutation of numbers $1$ to $n$ has a local maximum on $j^{th}$ position if number on $j^{th}$ position is bigger than both its neighbours. For first and last number of a permutation, local maximum exists if that number is bigger than its only neighbour. Knowing that every of $n!$ permutations is equally expected, calculate expected number of local maxima.



I tried defining $X$ (variable) with $X_i$ equal to number of local maxima on $i^{th}$ position, but couldn't continue past that.










share|cite|improve this question











$endgroup$




I'm trying solve this problem:



Permutation of numbers $1$ to $n$ has a local maximum on $j^{th}$ position if number on $j^{th}$ position is bigger than both its neighbours. For first and last number of a permutation, local maximum exists if that number is bigger than its only neighbour. Knowing that every of $n!$ permutations is equally expected, calculate expected number of local maxima.



I tried defining $X$ (variable) with $X_i$ equal to number of local maxima on $i^{th}$ position, but couldn't continue past that.







probability probability-distributions permutations expected-value






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 4 '18 at 22:06







Crabzmatic

















asked Dec 28 '16 at 21:48









CrabzmaticCrabzmatic

302214




302214












  • $begingroup$
    Putnam 2006-A4 See kskedlaya.org/putnam-archive/2006s.pdf
    $endgroup$
    – Catalin Zara
    Dec 28 '16 at 22:03










  • $begingroup$
    Hint: instead of counting by permutations (add the number of local maxima for each permutations), count by positions (add the number of permutations that have a local maximum at a specific position).
    $endgroup$
    – Catalin Zara
    Dec 28 '16 at 22:13












  • $begingroup$
    @CatalinZara The link that you provided answered my question and I'm very thankful for that. If you want you can post it as an answer so I can accept it.
    $endgroup$
    – Crabzmatic
    Dec 28 '16 at 22:27












  • $begingroup$
    I'm happy that you found an answer to your question, but I don't think providing a link really qualifies as an answer.
    $endgroup$
    – Catalin Zara
    Dec 28 '16 at 22:30










  • $begingroup$
    @CatalinZara You can always rewrite the answer from the link.
    $endgroup$
    – Crabzmatic
    Dec 28 '16 at 22:42


















  • $begingroup$
    Putnam 2006-A4 See kskedlaya.org/putnam-archive/2006s.pdf
    $endgroup$
    – Catalin Zara
    Dec 28 '16 at 22:03










  • $begingroup$
    Hint: instead of counting by permutations (add the number of local maxima for each permutations), count by positions (add the number of permutations that have a local maximum at a specific position).
    $endgroup$
    – Catalin Zara
    Dec 28 '16 at 22:13












  • $begingroup$
    @CatalinZara The link that you provided answered my question and I'm very thankful for that. If you want you can post it as an answer so I can accept it.
    $endgroup$
    – Crabzmatic
    Dec 28 '16 at 22:27












  • $begingroup$
    I'm happy that you found an answer to your question, but I don't think providing a link really qualifies as an answer.
    $endgroup$
    – Catalin Zara
    Dec 28 '16 at 22:30










  • $begingroup$
    @CatalinZara You can always rewrite the answer from the link.
    $endgroup$
    – Crabzmatic
    Dec 28 '16 at 22:42
















$begingroup$
Putnam 2006-A4 See kskedlaya.org/putnam-archive/2006s.pdf
$endgroup$
– Catalin Zara
Dec 28 '16 at 22:03




$begingroup$
Putnam 2006-A4 See kskedlaya.org/putnam-archive/2006s.pdf
$endgroup$
– Catalin Zara
Dec 28 '16 at 22:03












$begingroup$
Hint: instead of counting by permutations (add the number of local maxima for each permutations), count by positions (add the number of permutations that have a local maximum at a specific position).
$endgroup$
– Catalin Zara
Dec 28 '16 at 22:13






$begingroup$
Hint: instead of counting by permutations (add the number of local maxima for each permutations), count by positions (add the number of permutations that have a local maximum at a specific position).
$endgroup$
– Catalin Zara
Dec 28 '16 at 22:13














$begingroup$
@CatalinZara The link that you provided answered my question and I'm very thankful for that. If you want you can post it as an answer so I can accept it.
$endgroup$
– Crabzmatic
Dec 28 '16 at 22:27






$begingroup$
@CatalinZara The link that you provided answered my question and I'm very thankful for that. If you want you can post it as an answer so I can accept it.
$endgroup$
– Crabzmatic
Dec 28 '16 at 22:27














$begingroup$
I'm happy that you found an answer to your question, but I don't think providing a link really qualifies as an answer.
$endgroup$
– Catalin Zara
Dec 28 '16 at 22:30




$begingroup$
I'm happy that you found an answer to your question, but I don't think providing a link really qualifies as an answer.
$endgroup$
– Catalin Zara
Dec 28 '16 at 22:30












$begingroup$
@CatalinZara You can always rewrite the answer from the link.
$endgroup$
– Crabzmatic
Dec 28 '16 at 22:42




$begingroup$
@CatalinZara You can always rewrite the answer from the link.
$endgroup$
– Crabzmatic
Dec 28 '16 at 22:42










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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2075309%2fpermutation-with-local-maxima%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
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2075309%2fpermutation-with-local-maxima%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Wiesbaden

Marschland

Dieringhausen