activity
19942022
most citedSymbolic computation of hypergeometric type and non-holonomic power series

11 citations · 61 across the 21 of their papers we have counts for

collaborators

21 papers

cs.SC2022

FPS In Action: An Easy Way To Find Explicit Formulas For Interlaced Hypergeometric Sequences

Bertrand Teguia Tabuguia, Wolfram Koepf

Linear recurrence equations with constant coefficients define the power series coefficients of rational functions. However, one usually prefers to have an explicit formula for the…

math.CA2021

Recurrence equations involving different orthogonal polynomial sequences and applications

A. S. Jooste, D. D. Tcheutia, W. Koepf

Consider , a sequence of polynomials orthogonal with respect to on , and polynomials , orthog…

cs.SC2021

On the representation of non-holonomic univariate power series

Bertrand Teguia Tabuguia, Wolfram Koepf

Holonomic functions play an essential role in Computer Algebra since they allow the application of many symbolic algorithms. Among all algorithmic attempts to find formulas for pow…

cs.SC2021★ 11 cited

Symbolic computation of hypergeometric type and non-holonomic power series

Bertrand Teguia Tabuguia, Wolfram Koepf

A term is -fold hypergeometric, for a given positive integer , if the ratio is a rational function over a field of characteristic zero. We establish t…

math.CA2018★ 5 cited

Quasi-Orthogonality of Some Hypergeometric and -Hypergeometric Polynomials

Daniel D. Tcheutia, Alta S. Jooste, Wolfram Koepf

We show how to obtain linear combinations of polynomials in an orthogonal sequence , such as , $a_{n,0}a_{n,k}\…

math.RA2013★ 3 cited

Divisibility of Trinomials by Irreducible Polynomials over F2

Ryul Kim, Wolfram Koepf

Irreducible trinomials of given degree n over do not always exist and in the cases that there is no irreducible trinomial of degree n it may be effective to use trinomials wi…