On the minimal polynomial of the product of linear recurring sequences (Q1891284)

A sequence \(\{s_n \}_{n=0}^\infty\) of elements of an arbitrary field \(F\) is called a linear recurring sequence in \(F\) with characteristic polynomial \(f(x)= \sum_{i=0}^d c_ix^i\in F[x]\) if \(c_d=1\) and \(\sum_i c_i s_{n+i}=0\), \(n=0,1,\ldots\), where \(d\) is an arbitrary non-negative integer. For a linear recurring sequence \(\sigma\) its minimal polynomial is defined to be the unique characteristic polynomial of least degree. The linear complexity of the sequence is defined to be the degree of this minimal polynomial. Results on the minimal polynomial of the product of two linear recurring sequences are established in this work. In particular, a general lower bound on the linear complexity of the product sequence is established.