generating function for recursive formula of two variables

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
-1
down vote

favorite












I have a pice-wise function which is divided into even and odd parts as you can see in the following. I hope to know if there's a generating function that fit this recursive relation.

$$
f(x) =
left{
beginarrayll
2^j+1 sum_n=0^j alpha_ell,n x^2n+1 &ell=2j+1,\
2^j sum_n=0^j alpha_ell,n x^2n &ell=2j,\
endarray
right.
$$
$ell=0,1,2,ldots$, the coefficient $alpha_ell,n$ has the recursive relation
$$
left{
beginarrayll
alpha_2j+1,n = -(n+1)alpha_2j,n + 1 + alpha_2j,n &n=0,1,2,ldots,j-1\
alpha_2j,n = -( 2n + m)alpha_2j - 1,n + 2alpha_2j-1,n-1 &n=1,2,ldots,j-1\
endarray
right.
$$
(should mention here that the maximum of $n$ is $j-1$, so it doesn't break the boundary) and $alpha_0,0 = 1$, $alpha_1,0 = 1$, $alpha_2j,0 = -malpha_2j - 1,0$, $alpha_2j,j = 2alpha_2j-1,j-1$ and $alpha_2j+1,j = alpha_2j,j$.
and the value format of recurisve formula is like (only to show the format, the explicit formula is too long to show).
Any suggestion or advice is welcome. Thank you!







share|cite|improve this question























    up vote
    -1
    down vote

    favorite












    I have a pice-wise function which is divided into even and odd parts as you can see in the following. I hope to know if there's a generating function that fit this recursive relation.

    $$
    f(x) =
    left{
    beginarrayll
    2^j+1 sum_n=0^j alpha_ell,n x^2n+1 &ell=2j+1,\
    2^j sum_n=0^j alpha_ell,n x^2n &ell=2j,\
    endarray
    right.
    $$
    $ell=0,1,2,ldots$, the coefficient $alpha_ell,n$ has the recursive relation
    $$
    left{
    beginarrayll
    alpha_2j+1,n = -(n+1)alpha_2j,n + 1 + alpha_2j,n &n=0,1,2,ldots,j-1\
    alpha_2j,n = -( 2n + m)alpha_2j - 1,n + 2alpha_2j-1,n-1 &n=1,2,ldots,j-1\
    endarray
    right.
    $$
    (should mention here that the maximum of $n$ is $j-1$, so it doesn't break the boundary) and $alpha_0,0 = 1$, $alpha_1,0 = 1$, $alpha_2j,0 = -malpha_2j - 1,0$, $alpha_2j,j = 2alpha_2j-1,j-1$ and $alpha_2j+1,j = alpha_2j,j$.
    and the value format of recurisve formula is like (only to show the format, the explicit formula is too long to show).
    Any suggestion or advice is welcome. Thank you!







    share|cite|improve this question





















      up vote
      -1
      down vote

      favorite









      up vote
      -1
      down vote

      favorite











      I have a pice-wise function which is divided into even and odd parts as you can see in the following. I hope to know if there's a generating function that fit this recursive relation.

      $$
      f(x) =
      left{
      beginarrayll
      2^j+1 sum_n=0^j alpha_ell,n x^2n+1 &ell=2j+1,\
      2^j sum_n=0^j alpha_ell,n x^2n &ell=2j,\
      endarray
      right.
      $$
      $ell=0,1,2,ldots$, the coefficient $alpha_ell,n$ has the recursive relation
      $$
      left{
      beginarrayll
      alpha_2j+1,n = -(n+1)alpha_2j,n + 1 + alpha_2j,n &n=0,1,2,ldots,j-1\
      alpha_2j,n = -( 2n + m)alpha_2j - 1,n + 2alpha_2j-1,n-1 &n=1,2,ldots,j-1\
      endarray
      right.
      $$
      (should mention here that the maximum of $n$ is $j-1$, so it doesn't break the boundary) and $alpha_0,0 = 1$, $alpha_1,0 = 1$, $alpha_2j,0 = -malpha_2j - 1,0$, $alpha_2j,j = 2alpha_2j-1,j-1$ and $alpha_2j+1,j = alpha_2j,j$.
      and the value format of recurisve formula is like (only to show the format, the explicit formula is too long to show).
      Any suggestion or advice is welcome. Thank you!







      share|cite|improve this question











      I have a pice-wise function which is divided into even and odd parts as you can see in the following. I hope to know if there's a generating function that fit this recursive relation.

      $$
      f(x) =
      left{
      beginarrayll
      2^j+1 sum_n=0^j alpha_ell,n x^2n+1 &ell=2j+1,\
      2^j sum_n=0^j alpha_ell,n x^2n &ell=2j,\
      endarray
      right.
      $$
      $ell=0,1,2,ldots$, the coefficient $alpha_ell,n$ has the recursive relation
      $$
      left{
      beginarrayll
      alpha_2j+1,n = -(n+1)alpha_2j,n + 1 + alpha_2j,n &n=0,1,2,ldots,j-1\
      alpha_2j,n = -( 2n + m)alpha_2j - 1,n + 2alpha_2j-1,n-1 &n=1,2,ldots,j-1\
      endarray
      right.
      $$
      (should mention here that the maximum of $n$ is $j-1$, so it doesn't break the boundary) and $alpha_0,0 = 1$, $alpha_1,0 = 1$, $alpha_2j,0 = -malpha_2j - 1,0$, $alpha_2j,j = 2alpha_2j-1,j-1$ and $alpha_2j+1,j = alpha_2j,j$.
      and the value format of recurisve formula is like (only to show the format, the explicit formula is too long to show).
      Any suggestion or advice is welcome. Thank you!









      share|cite|improve this question










      share|cite|improve this question




      share|cite|improve this question









      asked Jul 23 at 13:42









      Ren Hu

      12




      12

























          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: false,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          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%2f2860386%2fgenerating-function-for-recursive-formula-of-two-variables%23new-answer', 'question_page');

          );

          Post as a guest



































          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%2f2860386%2fgenerating-function-for-recursive-formula-of-two-variables%23new-answer', 'question_page');

          );

          Post as a guest













































































          Comments

          Popular posts from this blog

          What is the equation of a 3D cone with generalised tilt?

          Relationship between determinant of matrix and determinant of adjoint?

          Color the edges and diagonals of a regular polygon