Expected number of parts of a uniformly selected partition of $n$











up vote
0
down vote

favorite












I have a very basic question on partition theory, which I feel should be very well known. Suppose that you fix a natural number $n$ and select a random partition $P$ of $n$ by choosing uniformly from the set of all partitions of $n$ (so that each partition has probability $frac{1}{p(n)}$ of being selected, where $p(n)$ stands for the number of partitions of $n$). My question is that, what is the best known estimate/approximation of the expected number of parts of $P$ and the length of the largest part of $P$?



Since the there is an inherent symmetry between the number of parts and the length of the largest part of a partition (which is more clear if one views the Young's diagram), and since the area of the Young's diagram is $n$, I suspect that the expectation is roughly of the order of $sqrt{n}$, although this is a heuristic guess. Can anyone give me the best known estimate?






combinatorics number-theory probability-theory integer-partitions







share|cite|improve this question


















  • 1




    An asymptotic formula is known: $sqrt{frac{3n}{2pi}}(log n+2gamma-logtfrac{pi}6)+{rm{O}}(log^3 n)$. Source: resolver.sub.uni-goettingen.de/purl?PPN362162050_0081
    – Andrew Woods
    15 hours ago












  • Thanks, Andrew!
    – abcd
    1 hour ago















up vote
0
down vote

favorite












I have a very basic question on partition theory, which I feel should be very well known. Suppose that you fix a natural number $n$ and select a random partition $P$ of $n$ by choosing uniformly from the set of all partitions of $n$ (so that each partition has probability $frac{1}{p(n)}$ of being selected, where $p(n)$ stands for the number of partitions of $n$). My question is that, what is the best known estimate/approximation of the expected number of parts of $P$ and the length of the largest part of $P$?



Since the there is an inherent symmetry between the number of parts and the length of the largest part of a partition (which is more clear if one views the Young's diagram), and since the area of the Young's diagram is $n$, I suspect that the expectation is roughly of the order of $sqrt{n}$, although this is a heuristic guess. Can anyone give me the best known estimate?






combinatorics number-theory probability-theory integer-partitions







share|cite|improve this question


















  • 1




    An asymptotic formula is known: $sqrt{frac{3n}{2pi}}(log n+2gamma-logtfrac{pi}6)+{rm{O}}(log^3 n)$. Source: resolver.sub.uni-goettingen.de/purl?PPN362162050_0081
    – Andrew Woods
    15 hours ago












  • Thanks, Andrew!
    – abcd
    1 hour ago













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I have a very basic question on partition theory, which I feel should be very well known. Suppose that you fix a natural number $n$ and select a random partition $P$ of $n$ by choosing uniformly from the set of all partitions of $n$ (so that each partition has probability $frac{1}{p(n)}$ of being selected, where $p(n)$ stands for the number of partitions of $n$). My question is that, what is the best known estimate/approximation of the expected number of parts of $P$ and the length of the largest part of $P$?



Since the there is an inherent symmetry between the number of parts and the length of the largest part of a partition (which is more clear if one views the Young's diagram), and since the area of the Young's diagram is $n$, I suspect that the expectation is roughly of the order of $sqrt{n}$, although this is a heuristic guess. Can anyone give me the best known estimate?






combinatorics number-theory probability-theory integer-partitions







share|cite|improve this question













I have a very basic question on partition theory, which I feel should be very well known. Suppose that you fix a natural number $n$ and select a random partition $P$ of $n$ by choosing uniformly from the set of all partitions of $n$ (so that each partition has probability $frac{1}{p(n)}$ of being selected, where $p(n)$ stands for the number of partitions of $n$). My question is that, what is the best known estimate/approximation of the expected number of parts of $P$ and the length of the largest part of $P$?



Since the there is an inherent symmetry between the number of parts and the length of the largest part of a partition (which is more clear if one views the Young's diagram), and since the area of the Young's diagram is $n$, I suspect that the expectation is roughly of the order of $sqrt{n}$, although this is a heuristic guess. Can anyone give me the best known estimate?






combinatorics number-theory probability-theory integer-partitions




combinatorics number-theory probability-theory integer-partitions






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 18 hours ago









abcd

646




646








  • 1




    An asymptotic formula is known: $sqrt{frac{3n}{2pi}}(log n+2gamma-logtfrac{pi}6)+{rm{O}}(log^3 n)$. Source: resolver.sub.uni-goettingen.de/purl?PPN362162050_0081
    – Andrew Woods
    15 hours ago












  • Thanks, Andrew!
    – abcd
    1 hour ago














  • 1




    An asymptotic formula is known: $sqrt{frac{3n}{2pi}}(log n+2gamma-logtfrac{pi}6)+{rm{O}}(log^3 n)$. Source: resolver.sub.uni-goettingen.de/purl?PPN362162050_0081
    – Andrew Woods
    15 hours ago












  • Thanks, Andrew!
    – abcd
    1 hour ago








1




1




An asymptotic formula is known: $sqrt{frac{3n}{2pi}}(log n+2gamma-logtfrac{pi}6)+{rm{O}}(log^3 n)$. Source: resolver.sub.uni-goettingen.de/purl?PPN362162050_0081
– Andrew Woods
15 hours ago






An asymptotic formula is known: $sqrt{frac{3n}{2pi}}(log n+2gamma-logtfrac{pi}6)+{rm{O}}(log^3 n)$. Source: resolver.sub.uni-goettingen.de/purl?PPN362162050_0081
– Andrew Woods
15 hours ago














Thanks, Andrew!
– abcd
1 hour ago




Thanks, Andrew!
– abcd
1 hour ago















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',
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%2f3004510%2fexpected-number-of-parts-of-a-uniformly-selected-partition-of-n%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3004510%2fexpected-number-of-parts-of-a-uniformly-selected-partition-of-n%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

android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

Image
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 0 This is a simple project showing cubes on Unity, exported to android project and imported on Android studio. On maifest file it showed following warning: Expecting <uses-feature android:name="android.software.leanback" android:required="false" /> tag I have no information about it. And also on default emptyview android project does not use/mention this feature. I know it is required by TV's and such but why its not added by default? Why is this? And Should I concern about it? android unity3d
Read more

SQL update select statement

Image
0 I'm trying to update an entry in my database (postgresql). I'm having a problem with updating the query: INSERT INTO prices (price, product_id) SELECT product_price, commn_id FROM products_temp as prod WHERE NOT EXISTS (SELECT * FROM prices od WHERE prod.commn_id = od.product_id) OR prod.product_price != ( SELECT price FROM prices as p WHERE p.product_id = prod.commn_id order by p.end desc LIMIT 1 ) Query works fine when i delete: OR prod.product_price != ( SELECT price FROM prices as p WHERE p.product_id = prod.commn_id order by p.end desc LIMIT 1 ) So it seems to me that it's looping through this operation. My question is, how can I fix it? sql postgresql
Read more

'app-layout' is not a known element: how to share Component with different Modules

Image
0 My application was working fine until I decided to go with lazy loading: So, my shared component looks like this: import { Component, Renderer2 } from '@angular/core'; export interface FormModel { captcha?: string; } @Component({ selector: 'app-layout', templateUrl: './app-layout.component.html', styleUrls: ['./app-layout.css'] }) export class FullLayoutComponent { } app-layout.component.ts I am using this component in my Another component say school-home.component.html like this: <app-layout> </app-layout> and it was working fine until I created a Module school-home.module.ts like this: import { NgModule } from '@angular/core'; import { CommonModule } from '@angular/common'; import { SchoolhomeRoutingModule
Read more