<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>03926925</id>
  <dt>j</dt>
  <an>03926925</an>
  <augroup>
    <au>Wimp, Jet</au>
    <au>Zeilberger, Doron</au>
  </augroup>
  <ti>Resurrecting the asymptotics of linear recurrences.</ti>
  <so>J. Math. Anal. Appl. 111, 162-176 (1985).</so>
  <py>1985</py>
  <pu>Elsevier, San Diego, CA</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>linear recurrence equations</ut>
    <ut>enumeration</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/0022-247X(85)90209-4</li>
  </ligroup>
  <abgroup>
    <ab>The theory of linear recurrences is presented and a number of examples are given. "In Section 1 we will introduce several examples of combinatorial families that are counted by solving a recurrence equation. Then we will go on, in Section 2, to give an account of the Birkhoff- Trjitzinski method and finally, in Section 3, we will give a few examples of combinatorial interest."</ab>
    <rv>P.Reichensperger</rv>
  </abgroup>
</item>