Formula for product of two polynomials
$begingroup$
I have found such a formula
$$
left(sum_{k=0}^n a_k z^k right)cdot left(sum_{j=0}^m b_j z^j right)=sum_{k=0}^{n+m} left( sum_{j=k-min(n,m)}^{min(k,max(n,m))}a_j b_{k-j} right)z^k,
$$
but seems it's too complicated. Is there any other formulas?
combinatorics polynomials
$endgroup$
add a comment |
$begingroup$
I have found such a formula
$$
left(sum_{k=0}^n a_k z^k right)cdot left(sum_{j=0}^m b_j z^j right)=sum_{k=0}^{n+m} left( sum_{j=k-min(n,m)}^{min(k,max(n,m))}a_j b_{k-j} right)z^k,
$$
but seems it's too complicated. Is there any other formulas?
combinatorics polynomials
$endgroup$
1
$begingroup$
The inner sum corresponds to a convolution of the coefficients. You may simplify it by going in the frequency domain (Fourier) for example (or $z$ transform), but it is unlikely it is what you are looking for.
$endgroup$
– Damien
Dec 20 '18 at 19:18
$begingroup$
@Damien Can you explane it as an asnwer?
$endgroup$
– Leox
Dec 20 '18 at 19:28
1
$begingroup$
I have no time now, sorry. You can find information on convolution here for example: en.wikipedia.org/wiki/Convolution. It is a well known operation, widely studied. Used for example to represent filtering
$endgroup$
– Damien
Dec 20 '18 at 19:41
$begingroup$
Not sure why the answer in there is not correct but may help: math.stackexchange.com/questions/1937543/…
$endgroup$
– NoChance
Dec 20 '18 at 20:22
add a comment |
$begingroup$
I have found such a formula
$$
left(sum_{k=0}^n a_k z^k right)cdot left(sum_{j=0}^m b_j z^j right)=sum_{k=0}^{n+m} left( sum_{j=k-min(n,m)}^{min(k,max(n,m))}a_j b_{k-j} right)z^k,
$$
but seems it's too complicated. Is there any other formulas?
combinatorics polynomials
$endgroup$
I have found such a formula
$$
left(sum_{k=0}^n a_k z^k right)cdot left(sum_{j=0}^m b_j z^j right)=sum_{k=0}^{n+m} left( sum_{j=k-min(n,m)}^{min(k,max(n,m))}a_j b_{k-j} right)z^k,
$$
but seems it's too complicated. Is there any other formulas?
combinatorics polynomials
combinatorics polynomials
edited Dec 20 '18 at 19:16
Leox
asked Dec 20 '18 at 19:09
LeoxLeox
5,3481424
5,3481424
1
$begingroup$
The inner sum corresponds to a convolution of the coefficients. You may simplify it by going in the frequency domain (Fourier) for example (or $z$ transform), but it is unlikely it is what you are looking for.
$endgroup$
– Damien
Dec 20 '18 at 19:18
$begingroup$
@Damien Can you explane it as an asnwer?
$endgroup$
– Leox
Dec 20 '18 at 19:28
1
$begingroup$
I have no time now, sorry. You can find information on convolution here for example: en.wikipedia.org/wiki/Convolution. It is a well known operation, widely studied. Used for example to represent filtering
$endgroup$
– Damien
Dec 20 '18 at 19:41
$begingroup$
Not sure why the answer in there is not correct but may help: math.stackexchange.com/questions/1937543/…
$endgroup$
– NoChance
Dec 20 '18 at 20:22
add a comment |
1
$begingroup$
The inner sum corresponds to a convolution of the coefficients. You may simplify it by going in the frequency domain (Fourier) for example (or $z$ transform), but it is unlikely it is what you are looking for.
$endgroup$
– Damien
Dec 20 '18 at 19:18
$begingroup$
@Damien Can you explane it as an asnwer?
$endgroup$
– Leox
Dec 20 '18 at 19:28
1
$begingroup$
I have no time now, sorry. You can find information on convolution here for example: en.wikipedia.org/wiki/Convolution. It is a well known operation, widely studied. Used for example to represent filtering
$endgroup$
– Damien
Dec 20 '18 at 19:41
$begingroup$
Not sure why the answer in there is not correct but may help: math.stackexchange.com/questions/1937543/…
$endgroup$
– NoChance
Dec 20 '18 at 20:22
1
1
$begingroup$
The inner sum corresponds to a convolution of the coefficients. You may simplify it by going in the frequency domain (Fourier) for example (or $z$ transform), but it is unlikely it is what you are looking for.
$endgroup$
– Damien
Dec 20 '18 at 19:18
$begingroup$
The inner sum corresponds to a convolution of the coefficients. You may simplify it by going in the frequency domain (Fourier) for example (or $z$ transform), but it is unlikely it is what you are looking for.
$endgroup$
– Damien
Dec 20 '18 at 19:18
$begingroup$
@Damien Can you explane it as an asnwer?
$endgroup$
– Leox
Dec 20 '18 at 19:28
$begingroup$
@Damien Can you explane it as an asnwer?
$endgroup$
– Leox
Dec 20 '18 at 19:28
1
1
$begingroup$
I have no time now, sorry. You can find information on convolution here for example: en.wikipedia.org/wiki/Convolution. It is a well known operation, widely studied. Used for example to represent filtering
$endgroup$
– Damien
Dec 20 '18 at 19:41
$begingroup$
I have no time now, sorry. You can find information on convolution here for example: en.wikipedia.org/wiki/Convolution. It is a well known operation, widely studied. Used for example to represent filtering
$endgroup$
– Damien
Dec 20 '18 at 19:41
$begingroup$
Not sure why the answer in there is not correct but may help: math.stackexchange.com/questions/1937543/…
$endgroup$
– NoChance
Dec 20 '18 at 20:22
$begingroup$
Not sure why the answer in there is not correct but may help: math.stackexchange.com/questions/1937543/…
$endgroup$
– NoChance
Dec 20 '18 at 20:22
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You may simplify a little by omitting the extremes of summation.
Define $a_i=0$ if $inotin{0,dots,n}$ and $b_j=0$ if $jnotin{1,dots,m}$.
Let $c_k$ be the coefficient of $z^j$ in the product. Then the formula is saying that
$$
c_k = sum_{substack{i,jinmathbb N\i+j=k}} a_ib_j
= sum_{iinmathbb N}a_i b_{k-i} .
$$
This is as simple as it gets.
This way you can extend the formula to Laurent series.
$endgroup$
add a comment |
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
});
}
});
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%2f3047879%2fformula-for-product-of-two-polynomials%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You may simplify a little by omitting the extremes of summation.
Define $a_i=0$ if $inotin{0,dots,n}$ and $b_j=0$ if $jnotin{1,dots,m}$.
Let $c_k$ be the coefficient of $z^j$ in the product. Then the formula is saying that
$$
c_k = sum_{substack{i,jinmathbb N\i+j=k}} a_ib_j
= sum_{iinmathbb N}a_i b_{k-i} .
$$
This is as simple as it gets.
This way you can extend the formula to Laurent series.
$endgroup$
add a comment |
$begingroup$
You may simplify a little by omitting the extremes of summation.
Define $a_i=0$ if $inotin{0,dots,n}$ and $b_j=0$ if $jnotin{1,dots,m}$.
Let $c_k$ be the coefficient of $z^j$ in the product. Then the formula is saying that
$$
c_k = sum_{substack{i,jinmathbb N\i+j=k}} a_ib_j
= sum_{iinmathbb N}a_i b_{k-i} .
$$
This is as simple as it gets.
This way you can extend the formula to Laurent series.
$endgroup$
add a comment |
$begingroup$
You may simplify a little by omitting the extremes of summation.
Define $a_i=0$ if $inotin{0,dots,n}$ and $b_j=0$ if $jnotin{1,dots,m}$.
Let $c_k$ be the coefficient of $z^j$ in the product. Then the formula is saying that
$$
c_k = sum_{substack{i,jinmathbb N\i+j=k}} a_ib_j
= sum_{iinmathbb N}a_i b_{k-i} .
$$
This is as simple as it gets.
This way you can extend the formula to Laurent series.
$endgroup$
You may simplify a little by omitting the extremes of summation.
Define $a_i=0$ if $inotin{0,dots,n}$ and $b_j=0$ if $jnotin{1,dots,m}$.
Let $c_k$ be the coefficient of $z^j$ in the product. Then the formula is saying that
$$
c_k = sum_{substack{i,jinmathbb N\i+j=k}} a_ib_j
= sum_{iinmathbb N}a_i b_{k-i} .
$$
This is as simple as it gets.
This way you can extend the formula to Laurent series.
answered Dec 20 '18 at 19:28
FedericoFederico
5,124514
5,124514
add a comment |
add a comment |
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.
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%2f3047879%2fformula-for-product-of-two-polynomials%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
1
$begingroup$
The inner sum corresponds to a convolution of the coefficients. You may simplify it by going in the frequency domain (Fourier) for example (or $z$ transform), but it is unlikely it is what you are looking for.
$endgroup$
– Damien
Dec 20 '18 at 19:18
$begingroup$
@Damien Can you explane it as an asnwer?
$endgroup$
– Leox
Dec 20 '18 at 19:28
1
$begingroup$
I have no time now, sorry. You can find information on convolution here for example: en.wikipedia.org/wiki/Convolution. It is a well known operation, widely studied. Used for example to represent filtering
$endgroup$
– Damien
Dec 20 '18 at 19:41
$begingroup$
Not sure why the answer in there is not correct but may help: math.stackexchange.com/questions/1937543/…
$endgroup$
– NoChance
Dec 20 '18 at 20:22