Order bounds for C^2-finite sequences

02/08/2023
∙
by   Manuel Kauers, et al.
∙
0
∙

A sequence is called C-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with C-finite coefficients. Recently, it was shown that such C^2-finite sequences satisfy similar closure properties as C-finite sequences. In particular, they form a difference ring. In this paper we present new techniques for performing these closure properties of C^2-finite sequences. These methods also allow us to derive order bounds which were not known before. Additionally, they provide more insight in the effectiveness of these computations. The results are based on the exponent lattice of algebraic numbers. We present an iterative algorithm which can be used to compute bases of such lattices.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment