Sequences with finitely many negative squares (Q1110063): Difference between revisions

Let \({\mathbb{N}}_ 0=\{all\) nonnegative integers\(\}\), \({\mathbb{Z}}=\{all\) integers including zero\(\}\), \({\mathbb{R}}=\{all\) real numbers\(\}\). The following theorems typify the nature of the results of this paper: Theorem. Suppose that the sequence \(f:{\mathbb{N}}_ 0\to {\mathbb{R}}\) has K negative squares and is polynomially determinate. Then there is a definitizing polynomial q for f, and any definitizing polynomial \(\tilde q\) for f has the form \(\tilde q=sq\), where s is a non-negative monic polynomial. Theorem. Assume that \(f:{\mathbb{N}}_ 0\to {\mathbb{Z}}\) satisfies \(| f(n)| \leq AB^ n\), (n\(\geq 0)\), where \(A>0\), \(0<B<2\). Then precisely one of the following two assertions is true: (i) rank of f is finite. (ii) The number of positive, as well as the negative, squares of f is infinity.