Binomial sum for an arbitrary function












2












$begingroup$


I'm looking for some known results for sum of this type but I can't find anything.
The sum is defined as:
$$S(x,a,b,n)=sum_{k=0}^n binom{n}{k} (-1)^{k} f((a(n-k)+bk)x)$$
where $f$ is an arbitrary function and $a$ and $b$ are real and positive constants.
For example for the function $f(x)=e^{x}$ the sum can be evaluated with Binomial Theorem and we have:
$$S(x,a,b,n)=(e^{ax}-e^{bx})^{n}$$
But for arbitrary function $f$?
Thanks.










share|cite|improve this question











$endgroup$












  • $begingroup$
    I suspect there is no compact representation of the sum without knowledge of $f$.
    $endgroup$
    – David G. Stork
    Dec 19 '18 at 16:43










  • $begingroup$
    There probably isn't a single method for evaluating the sum that works for all functions. If you happen to know a little bit about $f$, you can make certain generalizations, though. For example, if $f$ is linear, then $f((a(n-k)+bk)x)=f(anx)-f(akx)+f(bkx)$.
    $endgroup$
    – R. Burton
    Dec 19 '18 at 17:35










  • $begingroup$
    Thanks!! Yes, for an arbitrary function isn't improbable to obtain a closed form. I tried to obtain an Integral representation of the sum via Integral Transform but with no great results.
    $endgroup$
    – Papemax89
    Dec 19 '18 at 17:40


















2












$begingroup$


I'm looking for some known results for sum of this type but I can't find anything.
The sum is defined as:
$$S(x,a,b,n)=sum_{k=0}^n binom{n}{k} (-1)^{k} f((a(n-k)+bk)x)$$
where $f$ is an arbitrary function and $a$ and $b$ are real and positive constants.
For example for the function $f(x)=e^{x}$ the sum can be evaluated with Binomial Theorem and we have:
$$S(x,a,b,n)=(e^{ax}-e^{bx})^{n}$$
But for arbitrary function $f$?
Thanks.










share|cite|improve this question











$endgroup$












  • $begingroup$
    I suspect there is no compact representation of the sum without knowledge of $f$.
    $endgroup$
    – David G. Stork
    Dec 19 '18 at 16:43










  • $begingroup$
    There probably isn't a single method for evaluating the sum that works for all functions. If you happen to know a little bit about $f$, you can make certain generalizations, though. For example, if $f$ is linear, then $f((a(n-k)+bk)x)=f(anx)-f(akx)+f(bkx)$.
    $endgroup$
    – R. Burton
    Dec 19 '18 at 17:35










  • $begingroup$
    Thanks!! Yes, for an arbitrary function isn't improbable to obtain a closed form. I tried to obtain an Integral representation of the sum via Integral Transform but with no great results.
    $endgroup$
    – Papemax89
    Dec 19 '18 at 17:40
















2












2








2


0



$begingroup$


I'm looking for some known results for sum of this type but I can't find anything.
The sum is defined as:
$$S(x,a,b,n)=sum_{k=0}^n binom{n}{k} (-1)^{k} f((a(n-k)+bk)x)$$
where $f$ is an arbitrary function and $a$ and $b$ are real and positive constants.
For example for the function $f(x)=e^{x}$ the sum can be evaluated with Binomial Theorem and we have:
$$S(x,a,b,n)=(e^{ax}-e^{bx})^{n}$$
But for arbitrary function $f$?
Thanks.










share|cite|improve this question











$endgroup$




I'm looking for some known results for sum of this type but I can't find anything.
The sum is defined as:
$$S(x,a,b,n)=sum_{k=0}^n binom{n}{k} (-1)^{k} f((a(n-k)+bk)x)$$
where $f$ is an arbitrary function and $a$ and $b$ are real and positive constants.
For example for the function $f(x)=e^{x}$ the sum can be evaluated with Binomial Theorem and we have:
$$S(x,a,b,n)=(e^{ax}-e^{bx})^{n}$$
But for arbitrary function $f$?
Thanks.







functions summation binomial-coefficients integral-transforms






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 19 '18 at 16:58







Papemax89

















asked Dec 19 '18 at 16:33









Papemax89Papemax89

162




162












  • $begingroup$
    I suspect there is no compact representation of the sum without knowledge of $f$.
    $endgroup$
    – David G. Stork
    Dec 19 '18 at 16:43










  • $begingroup$
    There probably isn't a single method for evaluating the sum that works for all functions. If you happen to know a little bit about $f$, you can make certain generalizations, though. For example, if $f$ is linear, then $f((a(n-k)+bk)x)=f(anx)-f(akx)+f(bkx)$.
    $endgroup$
    – R. Burton
    Dec 19 '18 at 17:35










  • $begingroup$
    Thanks!! Yes, for an arbitrary function isn't improbable to obtain a closed form. I tried to obtain an Integral representation of the sum via Integral Transform but with no great results.
    $endgroup$
    – Papemax89
    Dec 19 '18 at 17:40




















  • $begingroup$
    I suspect there is no compact representation of the sum without knowledge of $f$.
    $endgroup$
    – David G. Stork
    Dec 19 '18 at 16:43










  • $begingroup$
    There probably isn't a single method for evaluating the sum that works for all functions. If you happen to know a little bit about $f$, you can make certain generalizations, though. For example, if $f$ is linear, then $f((a(n-k)+bk)x)=f(anx)-f(akx)+f(bkx)$.
    $endgroup$
    – R. Burton
    Dec 19 '18 at 17:35










  • $begingroup$
    Thanks!! Yes, for an arbitrary function isn't improbable to obtain a closed form. I tried to obtain an Integral representation of the sum via Integral Transform but with no great results.
    $endgroup$
    – Papemax89
    Dec 19 '18 at 17:40


















$begingroup$
I suspect there is no compact representation of the sum without knowledge of $f$.
$endgroup$
– David G. Stork
Dec 19 '18 at 16:43




$begingroup$
I suspect there is no compact representation of the sum without knowledge of $f$.
$endgroup$
– David G. Stork
Dec 19 '18 at 16:43












$begingroup$
There probably isn't a single method for evaluating the sum that works for all functions. If you happen to know a little bit about $f$, you can make certain generalizations, though. For example, if $f$ is linear, then $f((a(n-k)+bk)x)=f(anx)-f(akx)+f(bkx)$.
$endgroup$
– R. Burton
Dec 19 '18 at 17:35




$begingroup$
There probably isn't a single method for evaluating the sum that works for all functions. If you happen to know a little bit about $f$, you can make certain generalizations, though. For example, if $f$ is linear, then $f((a(n-k)+bk)x)=f(anx)-f(akx)+f(bkx)$.
$endgroup$
– R. Burton
Dec 19 '18 at 17:35












$begingroup$
Thanks!! Yes, for an arbitrary function isn't improbable to obtain a closed form. I tried to obtain an Integral representation of the sum via Integral Transform but with no great results.
$endgroup$
– Papemax89
Dec 19 '18 at 17:40






$begingroup$
Thanks!! Yes, for an arbitrary function isn't improbable to obtain a closed form. I tried to obtain an Integral representation of the sum via Integral Transform but with no great results.
$endgroup$
– Papemax89
Dec 19 '18 at 17:40












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%2f3046590%2fbinomial-sum-for-an-arbitrary-function%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%2f3046590%2fbinomial-sum-for-an-arbitrary-function%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

Quarter-circle Tiles

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Mont Emei