2000 character limit reached
Hypergeometric-Type Sequences (2401.00256v2)
Published 30 Dec 2023 in cs.SC and cs.DM
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 $\pi$, such as Chebyshev polynomials, $\left(\sin2\left(n\,\pi/4\right)\cdot\cos\left(n\,\pi/6\right)\right)_n$, and compositions like $\left(\sin\left(\cos(n\pi/3)\pi\right)\right)_n$. We describe an algorithm that computes a hypergeometric-type normal form of a given holonomic $n\text{th}$ term whenever it exists. Our implementation enables us to generate several identities for terms defined via trigonometric functions.
- S. A. Abramov. m-sparse solutions of linear ordinary differential equations with polynomial coefficients. Discrete Mathematics, 217(1-3):3–15, 2000.
- S. A. Abramov and M. Petkovšek. Minimal decomposition of indefinite hypergeometric sums. In Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, pages 7–14, 2001.
- Reduction-based creative telescoping for fuchsian D-finite functions. Journal of Symbolic Computation, 85:108–127, 2018.
- On the zeros of exponential polynomials. Journal of the ACM, 70(4):1–26, 2023.
- F. Chyzak. An extension of Zeilberger’s fast algorithm to general holonomic functions. Discrete Mathematics, 217(1-3):115–134, 2000.
- F. Chyzak. The ABC of Creative Telescoping — Algorithms, Bounds, Complexity. Habilitation à diriger des recherches, Ecole Polytechnique X, Apr. 2014.
- A non-holonomic systems approach to special function identities. In Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, pages 111–118, 2009.
- T. Cluzeau and M. van Hoeij. Computing hypergeometric solutions of linear recurrence equations. Applicable Algebra in Engineering, Communication and Computing, 17(2):83–115, 2006.
- T. Dreyfus. Hypertranscendence and linear difference equations, the exponential case. Preprint arXiv:2212.00388, 2022.
- M. C. Fasenmyer. Some Generalized Hypergeometric Polynomials. PhD thesis, University of Michigan, 1945.
- S. M. C. Fasenmyer. A note on pure recurrence relations. The American Mathematical Monthly, 56(1P1):14–17, 1949.
- Algorithms for Computer Algebra. Springer Science & Business Media, 1992.
- R. W. Gosper Jr. Decision procedure for indefinite hypergeometric summation. Proceedings of the National Academy of Sciences, 75(1):40–42, 1978.
- m-fold hypergeometric solutions of linear recurrence equations revisited. Mathematics in Computer Science, 6:61–77, 2012.
- A. Ibrahim and B. Salvy. Positivity certificates for linear recurrences. arXiv preprint arXiv:2306.05930, To appear in Proceedings SODA’24, 2023.
- M. Kauers. D-Finite Functions. Springer Cham, 2023.
- Ore polynomials in sage. Computer Algebra and Polynomials: Applications of Algebra and Number Theory, pages 105–125, 2015.
- M. Kauers and C. Koutschan. Guessing with little data. In Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation, pages 83–90, 2022.
- M. Kauers and V. Pillwein. When can we detect that a p-finite sequence is positive? In Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, pages 195–201, 2010.
- W. Koepf. Power series in computer algebra. Journal of Symbolic Computation, 13(6):581–603, 1992.
- W. Koepf. Algorithms for m-fold hypergeometric summation. Journal of Symbolic Computation, 20(4):399–417, 1995.
- W. Koepf. Hypergeometric Summation, An Algorithmic Approach to Summation and Special Function Identities. Springer-Verlag, London, 2nd edition, 2014.
- W. Koepf and B. Teguia Tabuguia. FPS: A Maple package for symbolic computations with power series and linear PDEs. Available at http://www.mathematik.uni-kassel.de/~bteguia/FPS_webpage/FPS.htm, 2022.
- C. Koutschan. Creative telescoping for holonomic functions. In Computer Algebra in Quantum Field Theory: Integration, Summation and Special Functions, pages 171–194. Springer, 2013.
- C. Koutschan. Holonomic functions in mathematica. ACM Communications in Computer Algebra, 47(3/4):179–182, 2014.
- C. Mallinger. Algorithmic manipulations and transformations of univariate holonomic functions and sequences. Citeseer, 1996.
- D-algebraic functions. arXiv preprint arXiv:2301.02512, 2023.
- J. Ouaknine and J. Worrell. Decision problems for linear recurrence sequences. In International Workshop on Reachability Problems, pages 21–28. Springer, 2012.
- J. Ouaknine and J. Worrell. Positivity problems for low-order linear recurrence sequences. In Proceedings of the twenty-fifth annual ACM-SIAM Symposium on Discrete Algorithms, pages 366–379. SIAM, 2014.
- P. Paule. Greatest factorial factorization and symbolic summation. Journal of Symbolic Computation, 20(3):235–268, 1995.
- M. Petkovšek. Hypergeometric solutions of linear recurrences with polynomial coefficients. Journal of symbolic computation, 14(2-3):243–264, 1992.
- M. Petkovšek and B. Salvy. Finding all hypergeometric solutions of linear differential equations. In Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, pages 27–33, 1993.
- A=B. Wellesley, Mass. Peters/CRC Press, 1996.
- V. Pillwein. Termination conditions for positivity proving procedures. In Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, pages 315–322, 2013.
- A. Ryabenko. Special formal series solutions of linear ordinary differential equations. In Formal Power Series and Algebraic Combinatorics, pages 356–366. Springer Berlin Heidelberg, 2000.
- Gröbner Deformations of Hypergeometric Differential Equations, volume 6. Springer Science & Business Media, 2013.
- B. Salvy and P. Zimmermann. GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable. ACM Transactions on Mathematical Software (TOMS), 20(2):163–177, 1994.
- N. J. Sloane et al. The online encyclopedia of integer sequences, 2003.
- B. Teguia Tabuguia. HyperTypeSeq: A Maple package for symbolic computations with hypergeometric type sequences. Available at https://github.com/T3gu1a/HyperTypeSeq.
- B. Teguia Tabuguia. Power Series Representations of Hypergeometric Type and Non-Holonomic Functions in Computer Algebra. PhD thesis, University of Kassel, 2020.
- B. Teguia Tabuguia. A variant of van Hoeij’s algorithm to compute hypergeometric term solutions of holonomic recurrence equations. Journal of Algorithms and Computation, 53(2):1–32, 2021.
- B. Teguia Tabuguia. Arithmetic of d-algebraic functions. arXiv preprint arXiv:2305.00702, 2023.
- B. Teguia Tabuguia and W. Koepf. Hypergeometric type power series. In The 4th International Conference “Computer Algebra, volume 28, pages 105–109, 2021.
- B. Teguia Tabuguia and W. Koepf. Power series representations of hypergeometric type functions. In R. Corless, J. Gerhard, and I. Kotsireas, editors, Maple in Mathematics Education and Research. MC 2020. Communications in Computer and Information Science, volume 1414. Springer, 2021.
- B. Teguia Tabuguia and W. Koepf. FPS in action: an easy way to find explicit formulas for interlaced hypergeometric sequences. ACM Communications in Computer Algebra, 56(2):46–50, 2022.
- B. Teguia Tabuguia and W. Koepf. Symbolic conversion of holonomic functions to hypergeometric type power series. Programming and Computer Software, 48(2):125–146, 2022.
- M. van Hoeij. Finite singularities and hypergeometric solutions of linear recurrence equations. Journal of Pure and Applied Algebra, 139(1-3):109–131, 1999.
- H. S. Wilf and D. Zeilberger. Towards computerized proofs of identities. Bulletin of the American Mathematical Society, 23(1):77–83, 1990.
- D. Zeilberger. A fast algorithm for proving terminating hypergeometric identities. Discrete mathematics, 80(2):207–211, 1990.
- D. Zeilberger. A holonomic systems approach to special functions identities. Journal of computational and applied mathematics, 32(3):321–368, 1990.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.