Solving equations in sequences
From MaRDI portal
This paper deals with equations of the form \(A\cdot X=B\), for given sequences \(A=(a_t)_{t\geq 0}\) and \(B=(b_t)_{t\geq 0}\), while the unknown sequence \(X=(x_t)_{t\geq 0}\) satisfies the known linear recurrence \(x_{t+n}=\sum_{i=0}^{n-1}c_ix_{t+i}\), \(t\geq 0\). To discuss the uniqueness of the solution, it has been shown that each of such equations can be transformed into a system of linear equations over \(F_2\). If the solution exists, the equation can be solved in polynomial time. For the entire collection see [Zbl 0719.00030].
Recommendations
- Linearly recurring solution sequences for equations over finite fields
- A note on the system of linear recurrence equations
- Solvability of sequence spaces equations of the form \({(E_a)}_{\Delta} + F_x = F_b\)
- scientific article; zbMATH DE number 484825
- The Set of Solutions of Some Equation for Linear Recurrence Sequences
Cited in
(6)- Diophantine representations of linear recurrences. I
- Linear recurring sequences over rings and modules
- Diophantine representations of linear recurrent sequences. II
- Solving recurrence relations using local invariants
- scientific article; zbMATH DE number 484825 (Why is no real title available?)
- Solving algebraic equations with Fibonacci sequences
This page was built for publication: Solving equations in sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972880)