Hypergeometric-Type Sequences
Symbolic Computation
2024-04-22 v2 Discrete Mathematics
Abstract
We introduce hypergeometric-type sequences. They are linear combinations of interlaced hypergeometric sequences (of arbitrary interlacements). We prove that they form a subring of the ring of holonomic sequences. An interesting family of sequences in this class are those defined by trigonometric functions with linear arguments in the index and , such as Chebyshev polynomials, , and compositions like . We describe an algorithm that computes a hypergeometric-type normal form of a given holonomic term whenever it exists. Our implementation enables us to generate several identities for terms defined via trigonometric functions.
Cite
@article{arxiv.2401.00256,
title = {Hypergeometric-Type Sequences},
author = {Bertrand Teguia Tabuguia},
journal= {arXiv preprint arXiv:2401.00256},
year = {2024}
}
Comments
23 pages. To appear in the Journal of Symbolic Computation