On finite sequences satisfying linear recursions (Q1348851)

Let \(k\) be a field, \(m\), \(n\) be integers satisfying \(0\leq 2m\leq n+1\). Denote by \(W_n\) the \((n+1)\)-dimensional linear space over \(k\) consisting of sequences \((x_0,x_1,\dots,x_n)\) and let \(H_m\subseteq W_n\) be a subset of sequences satisfying a linear recursion, or equivalently for which \((m+1)\times(n-m+1)\) Hankel matrix \((x_{i+j})_{0\leq i\leq m , 0\leq j\leq n-m}\) has rank at most \(m\). Properties of sets \(H_m\) are investigated. For \(k\) having \(q\) elements, the characteristic function of \(H_m\) is expressed as a linear combination of characteristic functions of some linear subspaces of \(W_n\). As a consequence, a new proof of the fact that the number of elements of \(H_m\) equals \(q^{2m}\) [cf. \textit{D. Daykin}, J. Reine Angew. Math. 203, 47-54 (1960; Zbl 0104.01304)] is obtained. A formula for the discrete Fourier transform of this characteristic function is deduced and applied to obtain some results on random Hankel matrices. The paper is concluded with some open questions.