Finding a closed form for a Recurrence












0












$begingroup$



Let $ f : mathbb{N}^3 to mathbb{R} $, where $f$ is defined by the following recurrence,
$$ f(x,y,z) = frac{1}{x} left[ sum_{n=0}^{x-1} f(x,y-1,n) cdot H[|z-n|-2] right] $$
where $x>z$, $f(x,0,z)=1, (forall x,zinmathbb{N})$, and $H[cdot]$ is the Heaviside step function.




This expression arose as recursive programming solution to a dice rolling puzzle. It translates fairly cleanly to code (mathematica: H[n_]:=Piecewise[{{0,n<0},{1,n>=0}}];f[x_,y_,z_]:=f[x,y,z]=Piecewise[{{1,y==0},{(1/x)*Sum[f[x,y-1,n]*H[Abs[z-n]-2],{n,0,x-1}],True}}];), but I am curious if a closed form or simpler recurrence exists.



Calculating one by hand shows a tree structure with depth $y$, where each node has $s-2$ or $s-3$ branches. This is due to the fact that $H[|z-n|-2]$ is $0$ only $2$ or $3$ times at each summation, but $1$ everywhere else.



Is there a closed form for this recurrence? If so, how do we find it? If not, why?



Note: Here's a plot of $g(x,y) = frac{1}{x} sum_{n=0}^{x-1}f(x,y-1,n)$,



g(x,y) plot










share|cite|improve this question









$endgroup$

















    0












    $begingroup$



    Let $ f : mathbb{N}^3 to mathbb{R} $, where $f$ is defined by the following recurrence,
    $$ f(x,y,z) = frac{1}{x} left[ sum_{n=0}^{x-1} f(x,y-1,n) cdot H[|z-n|-2] right] $$
    where $x>z$, $f(x,0,z)=1, (forall x,zinmathbb{N})$, and $H[cdot]$ is the Heaviside step function.




    This expression arose as recursive programming solution to a dice rolling puzzle. It translates fairly cleanly to code (mathematica: H[n_]:=Piecewise[{{0,n<0},{1,n>=0}}];f[x_,y_,z_]:=f[x,y,z]=Piecewise[{{1,y==0},{(1/x)*Sum[f[x,y-1,n]*H[Abs[z-n]-2],{n,0,x-1}],True}}];), but I am curious if a closed form or simpler recurrence exists.



    Calculating one by hand shows a tree structure with depth $y$, where each node has $s-2$ or $s-3$ branches. This is due to the fact that $H[|z-n|-2]$ is $0$ only $2$ or $3$ times at each summation, but $1$ everywhere else.



    Is there a closed form for this recurrence? If so, how do we find it? If not, why?



    Note: Here's a plot of $g(x,y) = frac{1}{x} sum_{n=0}^{x-1}f(x,y-1,n)$,



    g(x,y) plot










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$



      Let $ f : mathbb{N}^3 to mathbb{R} $, where $f$ is defined by the following recurrence,
      $$ f(x,y,z) = frac{1}{x} left[ sum_{n=0}^{x-1} f(x,y-1,n) cdot H[|z-n|-2] right] $$
      where $x>z$, $f(x,0,z)=1, (forall x,zinmathbb{N})$, and $H[cdot]$ is the Heaviside step function.




      This expression arose as recursive programming solution to a dice rolling puzzle. It translates fairly cleanly to code (mathematica: H[n_]:=Piecewise[{{0,n<0},{1,n>=0}}];f[x_,y_,z_]:=f[x,y,z]=Piecewise[{{1,y==0},{(1/x)*Sum[f[x,y-1,n]*H[Abs[z-n]-2],{n,0,x-1}],True}}];), but I am curious if a closed form or simpler recurrence exists.



      Calculating one by hand shows a tree structure with depth $y$, where each node has $s-2$ or $s-3$ branches. This is due to the fact that $H[|z-n|-2]$ is $0$ only $2$ or $3$ times at each summation, but $1$ everywhere else.



      Is there a closed form for this recurrence? If so, how do we find it? If not, why?



      Note: Here's a plot of $g(x,y) = frac{1}{x} sum_{n=0}^{x-1}f(x,y-1,n)$,



      g(x,y) plot










      share|cite|improve this question









      $endgroup$





      Let $ f : mathbb{N}^3 to mathbb{R} $, where $f$ is defined by the following recurrence,
      $$ f(x,y,z) = frac{1}{x} left[ sum_{n=0}^{x-1} f(x,y-1,n) cdot H[|z-n|-2] right] $$
      where $x>z$, $f(x,0,z)=1, (forall x,zinmathbb{N})$, and $H[cdot]$ is the Heaviside step function.




      This expression arose as recursive programming solution to a dice rolling puzzle. It translates fairly cleanly to code (mathematica: H[n_]:=Piecewise[{{0,n<0},{1,n>=0}}];f[x_,y_,z_]:=f[x,y,z]=Piecewise[{{1,y==0},{(1/x)*Sum[f[x,y-1,n]*H[Abs[z-n]-2],{n,0,x-1}],True}}];), but I am curious if a closed form or simpler recurrence exists.



      Calculating one by hand shows a tree structure with depth $y$, where each node has $s-2$ or $s-3$ branches. This is due to the fact that $H[|z-n|-2]$ is $0$ only $2$ or $3$ times at each summation, but $1$ everywhere else.



      Is there a closed form for this recurrence? If so, how do we find it? If not, why?



      Note: Here's a plot of $g(x,y) = frac{1}{x} sum_{n=0}^{x-1}f(x,y-1,n)$,



      g(x,y) plot







      recurrence-relations closed-form






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Dec 8 '18 at 19:02









      Dando18Dando18

      4,67741235




      4,67741235






















          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%2f3031487%2ffinding-a-closed-form-for-a-recurrence%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%2f3031487%2ffinding-a-closed-form-for-a-recurrence%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

          Aardman Animations

          Are they similar matrix

          “minimization” problem in Euclidean space related to orthonormal basis