Abstract A sequence of complex numbers is holonomic if it satisfies a linear recurrence with polynomial coefficients. A power series is holonomic if it satisfies a linear differential equation with polynomial coefficients, which is equivalent to its coefficient sequence being holonomic. It is well known that all algebraic power series are holonomic. We show that the analogous statement for sequences is false by proving that the sequence f p ngn is not holonomic. In addition, we show that fn n gn, the Lambert W function and flog ngn are not holonomic, where in the case of flog ngn we have to rely on an open conjecture from transcendental number theory
AbstractAllouche and Shallit generalized the concept of k-automatic sequences by introducing the not...
An infinite sequence unn of real numbers is holonomic (also known as P-recursive or P-finite) if it ...
This thesis shows how computer algebra makes it possible to manipulate a large class of sequences an...
Holonomic functions (respectively sequences) satisfy linear ordinary differential equations (respect...
Abstract. We establish that the sequences formed by logarithms and by “fractional ” powers of intege...
Holonomic functions play an essential role in Computer Algebra since they allow the application of m...
Holonomic techniques have deep roots going back to Wallis, Euler, and Gauss, and have evolved in mod...
24 pagesVarious sequences that possess explicit analytic expressions can be analysed asymptotically ...
Abstract. Various sequences that possess explicit analytic expressions can be analysed asymptoticall...
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients pol...
Horadam sequences are second-order recurrences depending on a family of four complex parameters: two...
Automatic sequences have many properties that other sequences (in particular, non-uniformly morphic ...
AbstractWe extend Zeilberger's fast algorithm for definite hypergeometric summation to non-hypergeom...
An infinite sequence ⟨u_n⟩_n of real numbers is holonomic (also known as P-recursive or P-finite) if...
We study decision problems for sequences which obey a second-order holonomic recurrence of the form ...
AbstractAllouche and Shallit generalized the concept of k-automatic sequences by introducing the not...
An infinite sequence unn of real numbers is holonomic (also known as P-recursive or P-finite) if it ...
This thesis shows how computer algebra makes it possible to manipulate a large class of sequences an...
Holonomic functions (respectively sequences) satisfy linear ordinary differential equations (respect...
Abstract. We establish that the sequences formed by logarithms and by “fractional ” powers of intege...
Holonomic functions play an essential role in Computer Algebra since they allow the application of m...
Holonomic techniques have deep roots going back to Wallis, Euler, and Gauss, and have evolved in mod...
24 pagesVarious sequences that possess explicit analytic expressions can be analysed asymptotically ...
Abstract. Various sequences that possess explicit analytic expressions can be analysed asymptoticall...
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients pol...
Horadam sequences are second-order recurrences depending on a family of four complex parameters: two...
Automatic sequences have many properties that other sequences (in particular, non-uniformly morphic ...
AbstractWe extend Zeilberger's fast algorithm for definite hypergeometric summation to non-hypergeom...
An infinite sequence ⟨u_n⟩_n of real numbers is holonomic (also known as P-recursive or P-finite) if...
We study decision problems for sequences which obey a second-order holonomic recurrence of the form ...
AbstractAllouche and Shallit generalized the concept of k-automatic sequences by introducing the not...
An infinite sequence unn of real numbers is holonomic (also known as P-recursive or P-finite) if it ...
This thesis shows how computer algebra makes it possible to manipulate a large class of sequences an...