@inproceedings{10.1145/1837934.1837974,
    Abstract = {We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed on a great many examples, there is no guarantee for them to terminate, and they do in fact not terminate for every input. For some restricted classes of P-finite recurrence equations of order up to three we provide a priori criteria that assert the termination of the algorithms.},
    Address = {New York, NY, USA},
    Author = {Kauers, Manuel and Pillwein, Veronika},
    BookTitle = {Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation},
    File = {When can we detect that a P-finite sequence is positive - - a - j.pdf},
    ISBN = {9781450301503},
    Keywords = {cylindrical decomposition, P-finite sequences, positivity},
    Location = {Munich, Germany},
    Pages = {195--201},
    Publisher = {Association for Computing Machinery},
    Series = {ISSAC '10},
    Title = {When Can We Detect That a P-Finite Sequence is Positive?},
    URL = {https://doi.org/10.1145/1837934.1837974},
    Year = {2010},
    bdsk-url-1 = {https://doi.org/10.1145/1837934.1837974},
    date-added = {2020-10-11 11:20:47 +0200},
    date-modified = {2020-10-11 11:20:47 +0200},
    numpages = {7},
    doi = {10.1145/1837934.1837974}
}

@inproceedings{10.1145/1837934.1837974, Abstract = {We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed on a great many examples, there is no guarantee for them to terminate, and they do in fact not terminate for every input. For some restricted classes of P-finite recurrence equations of order up to three we provide a priori criteria that assert the termination of the algorithms.}, Address = {New York, NY, USA}, Author = {Kauers, Manuel and Pillwein, Veronika}, BookTitle = {Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation}, File = {When can we detect that a P-finite sequence is positive - - a - j.pdf}, ISBN = {9781450301503}, Keywords = {cylindrical decomposition, P-finite sequences, positivity}, Location = {Munich, Germany}, Pages = {195--201}, Publisher = {Association for Computing Machinery}, Series = {ISSAC '10}, Title = {When Can We Detect That a P-Finite Sequence is Positive?}, URL = {https://doi.org/10.1145/1837934.1837974}, Year = {2010}, bdsk-url-1 = {https://doi.org/10.1145/1837934.1837974}, date-added = {2020-10-11 11:20:47 +0200}, date-modified = {2020-10-11 11:20:47 +0200}, numpages = {7}, doi = {10.1145/1837934.1837974} }