Approximating $sumlimits_{rsubset S}|r|!prodlimits_{xin r}x$












1












$begingroup$


There is a set $S={x_1, x_2, ..., x_N}.$



I'm trying to approximate this:
$$p(S)=sum_{rsubset S}|r|!prod_{xin r}x$$



I know that:



$$sum_{rsubset S}prod_{xin r}x=prod_{xin S}(1+x)$$



I was wondering if there is a way to approximate $p(S)$ with something.




An idea:
Change $x$ in $prodlimits_{xin S}(1+x)$ to $a(x)x$ so that:



$$prod_{xin S}(1+a(x)x)simsum_{rsubset S}|r|!prod_{xin r}x$$




Stirling's approximation



There is: $$n! sim (2pi n)^frac{1}{2}(frac{n}{e})^n$$
which for my problem $n^n$ is troubling and I can't fiure out a way for $prod_{xin S}(1+a(x)x)$ to make $n^n$. It could also go up to a power of e:
$$n! sim e^{log(2pi)/2-n+nlog(n)}$$
But again, can't figure out to handle $nlog(n)$.




I'm actually trying to do this:



$$frac{sumlimits_{rsubset S}|r|!prodlimits_{xin r}x}{sumlimits_{rsubset S, |r|ge 1}(|r|-1)!prodlimits_{xin r}x}$$



Which in my problems context: $sumlimits_{rsubset S}|r|!prodlimits_{xin r}x=1-sumlimits_{rsubset S, |r|ge 1}(|r|-1)!prodlimits_{xin r}x$
But I don't think there could be any shortcut.






combinatorics discrete-mathematics combinations approximation







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Are all the $x_i$s (positive) integers?
    $endgroup$
    – Cardioid_Ass_22
    Jan 12 at 17:45










  • $begingroup$
    @Cardioid_Ass_22 yes
    $endgroup$
    – Anais
    Jan 12 at 22:12










  • $begingroup$
    Perhaps this lower bound may be of some use to you $p(S)geq 1+sum_{xin S}x+sum_{rsubset S,|r|>1}2^{|r|}prod_{xin r} xgeq 1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}sum_{nin 2^r}prod_{xin n}x=1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}sum_{nsubset r}prod_{xin n}x=1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}prod_{xin r}(1+x)geq 1+sum_{xin S}x+sum_{rsubset S}prod_{xin r}(1+x)-1-sum_{xin S}(1+x)=sum_{rsubset S}prod_{xin r}(1+x)-|S|=sum_{tsubset S+1}prod_{yin t}y-|S|=prod_{yin S+1}(1+y)-|S|=prod_{xin S}(2+x)-|S|$
    $endgroup$
    – Cardioid_Ass_22
    Jan 12 at 22:23








  • 1




    $begingroup$
    In your last comment, when you have for the term where $r=emptyset$, you have $(-1)!$, could you explain what that is ? Also from since it is combinatorics, I would say that it is just that you should add a condition that $|r|geq 1$ right ?
    $endgroup$
    – P. Quinton
    Jan 13 at 12:37






  • 1




    $begingroup$
    @Anais I'm pretty sure I screwed something, if I can fix it I will undelete it. You didn't get the right result right ?
    $endgroup$
    – P. Quinton
    Jan 13 at 14:53


















1












$begingroup$


There is a set $S={x_1, x_2, ..., x_N}.$



I'm trying to approximate this:
$$p(S)=sum_{rsubset S}|r|!prod_{xin r}x$$



I know that:



$$sum_{rsubset S}prod_{xin r}x=prod_{xin S}(1+x)$$



I was wondering if there is a way to approximate $p(S)$ with something.




An idea:
Change $x$ in $prodlimits_{xin S}(1+x)$ to $a(x)x$ so that:



$$prod_{xin S}(1+a(x)x)simsum_{rsubset S}|r|!prod_{xin r}x$$




Stirling's approximation



There is: $$n! sim (2pi n)^frac{1}{2}(frac{n}{e})^n$$
which for my problem $n^n$ is troubling and I can't fiure out a way for $prod_{xin S}(1+a(x)x)$ to make $n^n$. It could also go up to a power of e:
$$n! sim e^{log(2pi)/2-n+nlog(n)}$$
But again, can't figure out to handle $nlog(n)$.




I'm actually trying to do this:



$$frac{sumlimits_{rsubset S}|r|!prodlimits_{xin r}x}{sumlimits_{rsubset S, |r|ge 1}(|r|-1)!prodlimits_{xin r}x}$$



Which in my problems context: $sumlimits_{rsubset S}|r|!prodlimits_{xin r}x=1-sumlimits_{rsubset S, |r|ge 1}(|r|-1)!prodlimits_{xin r}x$
But I don't think there could be any shortcut.






combinatorics discrete-mathematics combinations approximation







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Are all the $x_i$s (positive) integers?
    $endgroup$
    – Cardioid_Ass_22
    Jan 12 at 17:45










  • $begingroup$
    @Cardioid_Ass_22 yes
    $endgroup$
    – Anais
    Jan 12 at 22:12










  • $begingroup$
    Perhaps this lower bound may be of some use to you $p(S)geq 1+sum_{xin S}x+sum_{rsubset S,|r|>1}2^{|r|}prod_{xin r} xgeq 1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}sum_{nin 2^r}prod_{xin n}x=1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}sum_{nsubset r}prod_{xin n}x=1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}prod_{xin r}(1+x)geq 1+sum_{xin S}x+sum_{rsubset S}prod_{xin r}(1+x)-1-sum_{xin S}(1+x)=sum_{rsubset S}prod_{xin r}(1+x)-|S|=sum_{tsubset S+1}prod_{yin t}y-|S|=prod_{yin S+1}(1+y)-|S|=prod_{xin S}(2+x)-|S|$
    $endgroup$
    – Cardioid_Ass_22
    Jan 12 at 22:23








  • 1




    $begingroup$
    In your last comment, when you have for the term where $r=emptyset$, you have $(-1)!$, could you explain what that is ? Also from since it is combinatorics, I would say that it is just that you should add a condition that $|r|geq 1$ right ?
    $endgroup$
    – P. Quinton
    Jan 13 at 12:37






  • 1




    $begingroup$
    @Anais I'm pretty sure I screwed something, if I can fix it I will undelete it. You didn't get the right result right ?
    $endgroup$
    – P. Quinton
    Jan 13 at 14:53
















1












1








1


3



$begingroup$


There is a set $S={x_1, x_2, ..., x_N}.$



I'm trying to approximate this:
$$p(S)=sum_{rsubset S}|r|!prod_{xin r}x$$



I know that:



$$sum_{rsubset S}prod_{xin r}x=prod_{xin S}(1+x)$$



I was wondering if there is a way to approximate $p(S)$ with something.




An idea:
Change $x$ in $prodlimits_{xin S}(1+x)$ to $a(x)x$ so that:



$$prod_{xin S}(1+a(x)x)simsum_{rsubset S}|r|!prod_{xin r}x$$




Stirling's approximation



There is: $$n! sim (2pi n)^frac{1}{2}(frac{n}{e})^n$$
which for my problem $n^n$ is troubling and I can't fiure out a way for $prod_{xin S}(1+a(x)x)$ to make $n^n$. It could also go up to a power of e:
$$n! sim e^{log(2pi)/2-n+nlog(n)}$$
But again, can't figure out to handle $nlog(n)$.




I'm actually trying to do this:



$$frac{sumlimits_{rsubset S}|r|!prodlimits_{xin r}x}{sumlimits_{rsubset S, |r|ge 1}(|r|-1)!prodlimits_{xin r}x}$$



Which in my problems context: $sumlimits_{rsubset S}|r|!prodlimits_{xin r}x=1-sumlimits_{rsubset S, |r|ge 1}(|r|-1)!prodlimits_{xin r}x$
But I don't think there could be any shortcut.






combinatorics discrete-mathematics combinations approximation







share|cite|improve this question











$endgroup$




There is a set $S={x_1, x_2, ..., x_N}.$



I'm trying to approximate this:
$$p(S)=sum_{rsubset S}|r|!prod_{xin r}x$$



I know that:



$$sum_{rsubset S}prod_{xin r}x=prod_{xin S}(1+x)$$



I was wondering if there is a way to approximate $p(S)$ with something.




An idea:
Change $x$ in $prodlimits_{xin S}(1+x)$ to $a(x)x$ so that:



$$prod_{xin S}(1+a(x)x)simsum_{rsubset S}|r|!prod_{xin r}x$$




Stirling's approximation



There is: $$n! sim (2pi n)^frac{1}{2}(frac{n}{e})^n$$
which for my problem $n^n$ is troubling and I can't fiure out a way for $prod_{xin S}(1+a(x)x)$ to make $n^n$. It could also go up to a power of e:
$$n! sim e^{log(2pi)/2-n+nlog(n)}$$
But again, can't figure out to handle $nlog(n)$.




I'm actually trying to do this:



$$frac{sumlimits_{rsubset S}|r|!prodlimits_{xin r}x}{sumlimits_{rsubset S, |r|ge 1}(|r|-1)!prodlimits_{xin r}x}$$



Which in my problems context: $sumlimits_{rsubset S}|r|!prodlimits_{xin r}x=1-sumlimits_{rsubset S, |r|ge 1}(|r|-1)!prodlimits_{xin r}x$
But I don't think there could be any shortcut.






combinatorics discrete-mathematics combinations approximation




combinatorics discrete-mathematics combinations approximation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 13 at 20:59







Anais

















asked Jan 5 at 8:55









AnaisAnais

336




336








  • 1




    $begingroup$
    Are all the $x_i$s (positive) integers?
    $endgroup$
    – Cardioid_Ass_22
    Jan 12 at 17:45










  • $begingroup$
    @Cardioid_Ass_22 yes
    $endgroup$
    – Anais
    Jan 12 at 22:12










  • $begingroup$
    Perhaps this lower bound may be of some use to you $p(S)geq 1+sum_{xin S}x+sum_{rsubset S,|r|>1}2^{|r|}prod_{xin r} xgeq 1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}sum_{nin 2^r}prod_{xin n}x=1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}sum_{nsubset r}prod_{xin n}x=1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}prod_{xin r}(1+x)geq 1+sum_{xin S}x+sum_{rsubset S}prod_{xin r}(1+x)-1-sum_{xin S}(1+x)=sum_{rsubset S}prod_{xin r}(1+x)-|S|=sum_{tsubset S+1}prod_{yin t}y-|S|=prod_{yin S+1}(1+y)-|S|=prod_{xin S}(2+x)-|S|$
    $endgroup$
    – Cardioid_Ass_22
    Jan 12 at 22:23








  • 1




    $begingroup$
    In your last comment, when you have for the term where $r=emptyset$, you have $(-1)!$, could you explain what that is ? Also from since it is combinatorics, I would say that it is just that you should add a condition that $|r|geq 1$ right ?
    $endgroup$
    – P. Quinton
    Jan 13 at 12:37






  • 1




    $begingroup$
    @Anais I'm pretty sure I screwed something, if I can fix it I will undelete it. You didn't get the right result right ?
    $endgroup$
    – P. Quinton
    Jan 13 at 14:53
















  • 1




    $begingroup$
    Are all the $x_i$s (positive) integers?
    $endgroup$
    – Cardioid_Ass_22
    Jan 12 at 17:45










  • $begingroup$
    @Cardioid_Ass_22 yes
    $endgroup$
    – Anais
    Jan 12 at 22:12










  • $begingroup$
    Perhaps this lower bound may be of some use to you $p(S)geq 1+sum_{xin S}x+sum_{rsubset S,|r|>1}2^{|r|}prod_{xin r} xgeq 1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}sum_{nin 2^r}prod_{xin n}x=1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}sum_{nsubset r}prod_{xin n}x=1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}prod_{xin r}(1+x)geq 1+sum_{xin S}x+sum_{rsubset S}prod_{xin r}(1+x)-1-sum_{xin S}(1+x)=sum_{rsubset S}prod_{xin r}(1+x)-|S|=sum_{tsubset S+1}prod_{yin t}y-|S|=prod_{yin S+1}(1+y)-|S|=prod_{xin S}(2+x)-|S|$
    $endgroup$
    – Cardioid_Ass_22
    Jan 12 at 22:23








  • 1




    $begingroup$
    In your last comment, when you have for the term where $r=emptyset$, you have $(-1)!$, could you explain what that is ? Also from since it is combinatorics, I would say that it is just that you should add a condition that $|r|geq 1$ right ?
    $endgroup$
    – P. Quinton
    Jan 13 at 12:37






  • 1




    $begingroup$
    @Anais I'm pretty sure I screwed something, if I can fix it I will undelete it. You didn't get the right result right ?
    $endgroup$
    – P. Quinton
    Jan 13 at 14:53










1




1




$begingroup$
Are all the $x_i$s (positive) integers?
$endgroup$
– Cardioid_Ass_22
Jan 12 at 17:45




$begingroup$
Are all the $x_i$s (positive) integers?
$endgroup$
– Cardioid_Ass_22
Jan 12 at 17:45












$begingroup$
@Cardioid_Ass_22 yes
$endgroup$
– Anais
Jan 12 at 22:12




$begingroup$
@Cardioid_Ass_22 yes
$endgroup$
– Anais
Jan 12 at 22:12












$begingroup$
Perhaps this lower bound may be of some use to you $p(S)geq 1+sum_{xin S}x+sum_{rsubset S,|r|>1}2^{|r|}prod_{xin r} xgeq 1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}sum_{nin 2^r}prod_{xin n}x=1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}sum_{nsubset r}prod_{xin n}x=1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}prod_{xin r}(1+x)geq 1+sum_{xin S}x+sum_{rsubset S}prod_{xin r}(1+x)-1-sum_{xin S}(1+x)=sum_{rsubset S}prod_{xin r}(1+x)-|S|=sum_{tsubset S+1}prod_{yin t}y-|S|=prod_{yin S+1}(1+y)-|S|=prod_{xin S}(2+x)-|S|$
$endgroup$
– Cardioid_Ass_22
Jan 12 at 22:23






$begingroup$
Perhaps this lower bound may be of some use to you $p(S)geq 1+sum_{xin S}x+sum_{rsubset S,|r|>1}2^{|r|}prod_{xin r} xgeq 1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}sum_{nin 2^r}prod_{xin n}x=1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}sum_{nsubset r}prod_{xin n}x=1+sum_{xin S}{x}+sum_{rsubset S,|r|>1}prod_{xin r}(1+x)geq 1+sum_{xin S}x+sum_{rsubset S}prod_{xin r}(1+x)-1-sum_{xin S}(1+x)=sum_{rsubset S}prod_{xin r}(1+x)-|S|=sum_{tsubset S+1}prod_{yin t}y-|S|=prod_{yin S+1}(1+y)-|S|=prod_{xin S}(2+x)-|S|$
$endgroup$
– Cardioid_Ass_22
Jan 12 at 22:23






1




1




$begingroup$
In your last comment, when you have for the term where $r=emptyset$, you have $(-1)!$, could you explain what that is ? Also from since it is combinatorics, I would say that it is just that you should add a condition that $|r|geq 1$ right ?
$endgroup$
– P. Quinton
Jan 13 at 12:37




$begingroup$
In your last comment, when you have for the term where $r=emptyset$, you have $(-1)!$, could you explain what that is ? Also from since it is combinatorics, I would say that it is just that you should add a condition that $|r|geq 1$ right ?
$endgroup$
– P. Quinton
Jan 13 at 12:37




1




1




$begingroup$
@Anais I'm pretty sure I screwed something, if I can fix it I will undelete it. You didn't get the right result right ?
$endgroup$
– P. Quinton
Jan 13 at 14:53






$begingroup$
@Anais I'm pretty sure I screwed something, if I can fix it I will undelete it. You didn't get the right result right ?
$endgroup$
– P. Quinton
Jan 13 at 14:53












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%2f3062530%2fapproximating-sum-limits-r-subset-sr-prod-limits-x-in-rx%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%2f3062530%2fapproximating-sum-limits-r-subset-sr-prod-limits-x-in-rx%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

1300-talet

Image
Den här artikeln handlar om hundraårsperioden 1300–1399. För decenniet 1300–1309, se 1300-talet (decennium). .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output ...
Read more

1300-talet

Image
Den här artikeln handlar om hundraårsperioden 1300–1399. För decenniet 1300–1309, se 1300-talet (decennium). .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output ...
Read more

Display a custom attribute below product name in the front-end Magento 1.9.3.8

Image
0 I need to display a custom attribute bellow the product name and I don't know how can I call this attribute. I am editing the file /app/design/frontend/templatemela/MAG100219_1/template/catalog/product/view.phtml But how can I call this attribute in php? I tried calling a string echo with the name I put in the attribute, but it didn't work. Code is as below: <div class="page-title product-title"> <h1><?php echo $_helper->productAttribute($_product, $_product->getName(), 'name') ?></h1> </div> <div class="codigoinmetro"> <h2><?php echo $_helper->productAttribute($_product, $_product->getName(), 'registroinmetro') ?></h2> </div> php attrib...
Read more