The Sidel'nikov method for estimating the number of signs on segments of linear recurrence sequences over Galois rings (Q2435949): Difference between revisions

Let \(u_1, u_2,\ldots, u_r\) be \(r\) linearly independent linear recurrence sequences over the Galois ring \(R = \mathrm{GR}(q^n,p^n)\) with \(q^n\) elements and of characteristic \(p^n\), and assume that all sequences have the same characteristic polynomial. For a positive integer \(l\) and an \(r\)-tuple \(\bar{z} = ( z_1,z_2,\ldots,z_r)\) over \(R\) denote by \(N_l(\bar{z},u_1,\ldots,u_r)\) the number of \(i \in \{0,\ldots,l-1\}\) such that \(u_1(i) = z_1, u_2(i) = z_2, \ldots, u_r(i) = z_r\), where \(u_j(i)\) is the \(i\)th term of the sequence \(u_j\). The author uses character sums to estimate \(N_l(\bar{z},u_1,\ldots,u_r)\). He gives conditions under which the estimate improves his earlier estimate in [Sb. Math. 200, No. 4, 499--519 (2009); translation from Mat. Sb. 200, No. 4, 31--52 (2009; Zbl 1232.94013)].