Recovering a linear recurrence with the extended Euclidean algorithm

Правка en10, от adamant, 2022-04-06 03:41:10

Hi everyone!

Recently I've posted an article about continued fractions on CP-Algorithms. One very interesting detail about it is that it is possible to define a continued fraction analogue for formal power series and, due to the connection of continued fractions with the Euclidean algorithm, it would also allow to quickly compute greatest common divisor and best rational function approximation for power series.

The task of finding the minimum linear recurrence for the given starting sequence is typically solved with the Berlekamp-Massey algorithm. In this article I would like to highlight another possible approach, with the use of the extended Euclidean algorithm.

Linear recurrence interpolation

In the previous article on linear recurrences we derived that the generating function of the linear recurrence always looks like

$$$ G(x) = \frac{P(x)}{Q(x)}, $$$

where $$$P(x)$$$ and $$$Q(x)$$$ are polynomials and $$$\deg P < \deg Q$$$. In this representation, $$$Q(x) = 1 - \sum\limits_{k=1}^d a_k x^k$$$ corresponds to

$$$ F_n = \sum\limits_{k=1}^d a_k F_{n-k}. $$$

Typical competitive programming task of recovering linear recurrence is formulated as follows:


Find Linear Recurrence. You're given $$$F_0, \dots, F_{m}$$$. Find $$$a_1, \dots, a_d$$$ with minimum $$$d$$$ such that $$$F_n = \sum\limits_{k=1}^d a_k F_{n-k}$$$.
In formal power series terms it means that we're given $$$F(x) = F_0 + F_1 x + \dots + F_{m}x^{m}$$$ and we need to find $$$\frac{P(x)}{Q(x)}$$$ such that
$$$ F(x) \equiv \frac{P(x)}{Q(x)} \pmod{x^{m+1}} $$$

and $$$d = \deg Q(x)$$$ is the minimum possible. In other words, what we're asked to do is to find the Padé approximant of $$$F(x)$$$.

Padé approximants


Given a formal power series $$$f(x) = \sum\limits_{k=0}^\infty f_k x^k$$$, its Padé approximant of order $$$[p/q]$$$ is the rational function

$$$ R(x) = \frac{a_0 + a_1 x + \dots + a_p x^p}{1+b_1 x + \dots + b_q x^q}=\frac{P(x)}{Q(x)} $$$

such that $$$f(x) \equiv R(x) \pmod{x^{p+q+1}}$$$. The Padé approximant is unique for any given $$$p$$$ and $$$q$$$ and is denoted $$$[p/q]_{f}(x) = R(x)$$$.


By definition, for Padé approximants generally holds

$$$ [p/q]_f \equiv [(p+k)/(q+l)]_f \pmod {x^{p+q+1}}. $$$

From this follows that the generating function of the linear recurrence is also the Padé approximant $$$[\deg P / \deg Q]_F$$$. Moreover, since

$$$ F(x) \equiv \frac{P(x)}{Q(x)} \pmod{x^{m+1}}, $$$

it also holds that $$$\frac{P(x)}{Q(x)} = [(\deg P + \alpha)/(\deg Q + \beta)]_F$$$ for any $$$\alpha + \beta \leq m - \deg P - \deg Q$$$.

Therefore, the needed fraction $$$\frac{P(x)}{Q(x)}$$$ can be found among $$$[1/m]_F, [2/(m-1)]_F,\dots,[m/1]_F$$$.

Extended Euclidean algorithm

Let's look again on the condition

$$$ F(x) \equiv \frac{P(x)}{Q(x)} \pmod{x^{m+1}}. $$$

It translates into the following Bézout's identity:

$$$ F(x) Q(x) = P(x) + x^{m+1} K(x), $$$

where $$$K(x)$$$ is a formal power series. When $$$P(x)$$$ is divisible by $$$\gcd(F(x), x^{m+1})$$$ the solution to this equation can be found with the extended Euclidean algorithm. Turns out, the extended Euclidean algorithm can also be used to enumerate all $$$[p/q]_F$$$ with $$$p+q=m$$$.

Let's formalize the extended Euclidean algorithm of $$$A(x)$$$ and $$$B(x)$$$. Starting with $$$r_{-2} = A$$$ and $$$r_{-1} = B$$$, we compute the sequence

$$$ r_{k+1} = r_{k-1} \mod r_{k} = r_{k-1} - a_k r_k. $$$

If you're familiar with the continued fractions, you could recognize, that this sequence corresponds to the representation

$$$ \frac{A(x)}{B(x)} = a_0(x) + \frac{1}{a_1(x) + \frac{1}{a_2(x) + \frac{1}{\dots}}} = [a_0(x); a_1(x), a_2(x), \dots]. $$$

Same as with rational numbers, for such sequence it is possible to define the sequence of convergents

$$$ \frac{p_k(x)}{q_k(x)} = [a_0(x); a_1(x), \dots, a_k(x)] = \frac{a_{k}(x) p_{k-1}(x) + p_{k-2}(x)}{a_{k}(x) q_{k-1}(x) + q_{k-2}(x)}, $$$

starting with

$$$ \begin{matrix} \frac{p_{-2}(x)}{q_{-2}(x)} = \frac{0}{1}, & \frac{p_{-1}(x)}{q_{-1}(x)} = \frac{1}{0}, & \frac{p_{0}(x)}{q_{0}(x)} = \frac{a_0(x)}{1},& \dots \end{matrix} $$$

Now, one can prove the following identity:

$$$ (-1)^{k}r_k(x) = q_k(x) A(x) - p_k(x) B(x). $$$
Explanation

In other words, we get three sequences $$$r_k$$$, $$$p_k$$$ and $$$q_k$$$ that define a family of solutions to the Bézout's identity.

Using $$$A(x) = x^{m+1}$$$ and $$$B(x) = F(x)$$$, we conclude that

$$$ F(x) \equiv \frac{(-1)^k r_k(x)}{q_k(x)} \pmod{x^{m+1}}. $$$

Note that $$$\deg r_k$$$ monotonously decreases until $$$r_k=0$$$ while $$$\deg q_k$$$ monotonously increases until $$$q_k = \frac{B(x)}{\gcd(B(x), x^{m+1})}$$$. Moreover,

$$$\deg q_{k} - \deg q_{k-1} = \deg r_{k-1} - \deg r_k = \deg a_{k}.$$$

From this follows that if you find $$$k$$$ such that $$$\deg q_k \leq q$$$ and $$$\deg q_{k+1} > q$$$, assuming $$$p+q=m$$$, it will hold that

$$$ [p/q]_F = \frac{(-1)^k r_k}{q_k}. $$$

And, finally, the optimal linear recurrence is defined by the first $$$k$$$ such that $$$\deg r_k < \deg q_k$$$ and $$$q_k(0) \neq 0$$$. However, note that this solution assumes that we're looking for the non-degenerate linear recurrence. That is, we say that the recurrence

$$$F_n = \sum\limits_{k=1}^d a_k F_{n-k}$$$

is valid only when $$$a_d \neq 0$$$, that is all $$$d$$$ previous values have to be used. Otherwise you'd need to deal with some degenerate cases.

Half-GCD algorithm

The notion above provides the basis to construct the $$$O(n \log^2 n)$$$ divide and conquer algorithm of computing $$$\gcd(P, Q)$$$ in polynomials and finding the minimum linear recurrence. I have a truly marvelous demonstration of this proposition that this margin is, unfortunately, too narrow to contain. I hope, I will be able to formalize the process for good and write an article about it sometime...

Теги berlekamp-massey, tutorial, linear recurrence, continued fraction

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en45 Английский adamant 2022-07-22 14:30:59 12
en44 Английский adamant 2022-07-22 14:30:30 31
en43 Английский adamant 2022-07-21 21:44:21 7000
en42 Английский adamant 2022-07-21 16:37:28 18
en41 Английский adamant 2022-04-08 17:18:50 140
en40 Английский adamant 2022-04-08 17:17:39 491
en39 Английский adamant 2022-04-08 17:07:37 37
en38 Английский adamant 2022-04-08 17:06:22 21
en37 Английский adamant 2022-04-08 17:04:53 773
en36 Английский adamant 2022-04-08 15:39:20 10
en35 Английский adamant 2022-04-08 15:38:39 5
en34 Английский adamant 2022-04-08 15:27:29 74
en33 Английский adamant 2022-04-08 15:24:39 22
en32 Английский adamant 2022-04-08 15:22:01 5090 explaining on pade approximants, b0=1 and bq=1
en31 Английский adamant 2022-04-07 22:03:19 253 rephrase tldr
en30 Английский adamant 2022-04-06 23:37:11 13
en29 Английский adamant 2022-04-06 22:19:33 334 problem example
en28 Английский adamant 2022-04-06 21:22:31 13
en27 Английский adamant 2022-04-06 21:21:31 105
en26 Английский adamant 2022-04-06 21:14:41 1082 Tldr
en25 Английский adamant 2022-04-06 18:50:52 34
en24 Английский adamant 2022-04-06 18:50:22 114
en23 Английский adamant 2022-04-06 17:23:32 1953
en22 Английский adamant 2022-04-06 17:05:46 1249
en21 Английский adamant 2022-04-06 16:43:26 89
en20 Английский adamant 2022-04-06 16:32:56 838 explanation
en19 Английский adamant 2022-04-06 14:57:04 216 it seems it is not necessarily unique?
en18 Английский adamant 2022-04-06 14:02:54 509 less continued fractions, they probably scare away people
en17 Английский adamant 2022-04-06 13:59:17 85
en16 Английский adamant 2022-04-06 13:57:34 47
en15 Английский adamant 2022-04-06 13:56:19 9
en14 Английский adamant 2022-04-06 13:53:57 1338 finally got the hang of it
en13 Английский adamant 2022-04-06 06:46:22 113 some edge case still need to be considered (published)
en12 Английский adamant 2022-04-06 06:00:12 0 (saved to drafts)
en11 Английский adamant 2022-04-06 03:49:58 15
en10 Английский adamant 2022-04-06 03:41:10 345
en9 Английский adamant 2022-04-06 03:23:06 77
en8 Английский adamant 2022-04-06 03:14:13 5
en7 Английский adamant 2022-04-06 02:13:21 86
en6 Английский adamant 2022-04-06 01:37:01 13
en5 Английский adamant 2022-04-06 01:28:10 57
en4 Английский adamant 2022-04-06 01:23:00 29
en3 Английский adamant 2022-04-06 00:10:26 9 I'm not sure
en2 Английский adamant 2022-04-05 23:29:13 22
en1 Английский adamant 2022-04-05 23:27:31 6370 Initial revision (published)