Solving 2-dimensional recurrence matrix of homogenous polynomials
$begingroup$
In $2012$, Rajkumar presented an interesting simplification of Apéry's theorem, i.e., that $zeta(3)$ is irrational, where $zeta$ denotes the Riemann zeta function. I am trying to understand his proof, but I severely lack knowledge on solving 2-dimensional recurrence relations in multiple homogeneous polynomials. In particular, he begain by defining
$$
f(i,j)=i^3+2i^2j+2ij^2+j^3, \
g(i,j)=i^3-2i^2j+2ij^2-j^3.
$$
He then constructed the recurrence relation
$$
left(begin{array}{cc}
f(i,j) & g(0,j) \
f(0,j) & g(i,j)
end{array}right)
left(begin{array}{c}
u_{i-1,j}\
u_{i-1,j-1}
end{array}right)
=
f(i,0)
left(begin{array}{c}
u_{i,j}\
u_{i,j-1}
end{array}right)
$$
and showed that for integers $i, j geq 1$ it has a rational valued solution $u_{i,j}$ for certain boundary conditions.
I would really like to understand how one solves such recurrence relations, but unfortunately after searching extensively on the internet for related articles or tutorials I have found nothing. I understand how basic recurrence relations work, but in this case I'm not sure what I'm supposed to do and what theory I can apply.
Can anyone give me any pointers?
polynomials recurrence-relations
$endgroup$
add a comment |
$begingroup$
In $2012$, Rajkumar presented an interesting simplification of Apéry's theorem, i.e., that $zeta(3)$ is irrational, where $zeta$ denotes the Riemann zeta function. I am trying to understand his proof, but I severely lack knowledge on solving 2-dimensional recurrence relations in multiple homogeneous polynomials. In particular, he begain by defining
$$
f(i,j)=i^3+2i^2j+2ij^2+j^3, \
g(i,j)=i^3-2i^2j+2ij^2-j^3.
$$
He then constructed the recurrence relation
$$
left(begin{array}{cc}
f(i,j) & g(0,j) \
f(0,j) & g(i,j)
end{array}right)
left(begin{array}{c}
u_{i-1,j}\
u_{i-1,j-1}
end{array}right)
=
f(i,0)
left(begin{array}{c}
u_{i,j}\
u_{i,j-1}
end{array}right)
$$
and showed that for integers $i, j geq 1$ it has a rational valued solution $u_{i,j}$ for certain boundary conditions.
I would really like to understand how one solves such recurrence relations, but unfortunately after searching extensively on the internet for related articles or tutorials I have found nothing. I understand how basic recurrence relations work, but in this case I'm not sure what I'm supposed to do and what theory I can apply.
Can anyone give me any pointers?
polynomials recurrence-relations
$endgroup$
add a comment |
$begingroup$
In $2012$, Rajkumar presented an interesting simplification of Apéry's theorem, i.e., that $zeta(3)$ is irrational, where $zeta$ denotes the Riemann zeta function. I am trying to understand his proof, but I severely lack knowledge on solving 2-dimensional recurrence relations in multiple homogeneous polynomials. In particular, he begain by defining
$$
f(i,j)=i^3+2i^2j+2ij^2+j^3, \
g(i,j)=i^3-2i^2j+2ij^2-j^3.
$$
He then constructed the recurrence relation
$$
left(begin{array}{cc}
f(i,j) & g(0,j) \
f(0,j) & g(i,j)
end{array}right)
left(begin{array}{c}
u_{i-1,j}\
u_{i-1,j-1}
end{array}right)
=
f(i,0)
left(begin{array}{c}
u_{i,j}\
u_{i,j-1}
end{array}right)
$$
and showed that for integers $i, j geq 1$ it has a rational valued solution $u_{i,j}$ for certain boundary conditions.
I would really like to understand how one solves such recurrence relations, but unfortunately after searching extensively on the internet for related articles or tutorials I have found nothing. I understand how basic recurrence relations work, but in this case I'm not sure what I'm supposed to do and what theory I can apply.
Can anyone give me any pointers?
polynomials recurrence-relations
$endgroup$
In $2012$, Rajkumar presented an interesting simplification of Apéry's theorem, i.e., that $zeta(3)$ is irrational, where $zeta$ denotes the Riemann zeta function. I am trying to understand his proof, but I severely lack knowledge on solving 2-dimensional recurrence relations in multiple homogeneous polynomials. In particular, he begain by defining
$$
f(i,j)=i^3+2i^2j+2ij^2+j^3, \
g(i,j)=i^3-2i^2j+2ij^2-j^3.
$$
He then constructed the recurrence relation
$$
left(begin{array}{cc}
f(i,j) & g(0,j) \
f(0,j) & g(i,j)
end{array}right)
left(begin{array}{c}
u_{i-1,j}\
u_{i-1,j-1}
end{array}right)
=
f(i,0)
left(begin{array}{c}
u_{i,j}\
u_{i,j-1}
end{array}right)
$$
and showed that for integers $i, j geq 1$ it has a rational valued solution $u_{i,j}$ for certain boundary conditions.
I would really like to understand how one solves such recurrence relations, but unfortunately after searching extensively on the internet for related articles or tutorials I have found nothing. I understand how basic recurrence relations work, but in this case I'm not sure what I'm supposed to do and what theory I can apply.
Can anyone give me any pointers?
polynomials recurrence-relations
polynomials recurrence-relations
edited Dec 13 '18 at 8:50
Klangen
asked Oct 12 '18 at 14:18
KlangenKlangen
1,69811334
1,69811334
add a comment |
add a comment |
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
});
}
});
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%2f2952729%2fsolving-2-dimensional-recurrence-matrix-of-homogenous-polynomials%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
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%2f2952729%2fsolving-2-dimensional-recurrence-matrix-of-homogenous-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