English

Factorization of C-finite Sequences

Symbolic Computation 2016-01-13 v1

Abstract

We discuss how to decide whether a given C-finite sequence can be written nontrivially as a product of two other C-finite sequences.

Cite

@article{arxiv.1601.02756,
  title  = {Factorization of C-finite Sequences},
  author = {Manuel Kauers and Doron Zeilberger},
  journal= {arXiv preprint arXiv:1601.02756},
  year   = {2016}
}
R2 v1 2026-06-22T12:27:33.653Z