首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Recurrent and almost-periodic sequences
Authors:Lutz G Lucht
Institution:1. Institut für Mathematik, Technische Universit?t Clausthal, Erzstr. 1, D-38678, Clausthal-Zellerfeld
Abstract:A sequence g : NC is called almost-periodic if it belongs to the completion MediaObjects/13_2009_680100022_f1.jpg of the C-linear space spanned by the sequences e ϑ with ϑR/Z, where e ϑ(n) = e 2πiϑn for nN, under the semi-norm MediaObjects/13_2009_680100022_f2.jpg. Every MediaObjects/13_2009_680100022_f3.jpg has a mean value MediaObjects/13_2009_680100022_f4.jpg. A sequence g: NC is called recurrent if it satisfies a linear recurrence equation of the form

$$g\left( {n + k} \right) + a_{k - 1} g\left( {n + k - 1} \right) +  \cdots  + a_0 g\left( n \right) = 0     \left( {n \in N, n > n_0 } \right)$$
with coefficients a k−1...,a 0C, a 0 ≠ 0, and with some numbers k, n 0N ∪ {0}. Let ℜ denote the space of recurrent sequences. It is shown that a sequence MediaObjects/13_2009_680100022_f5.jpg cannot belong to ℜ if M (g e ϑ) ≠ 0 for infinitely many ϑR/Z, which extends a recent result of Spilker. The proof is based on Kronecker’s rationality test.
Keywords:Mathematics Subject Classification (1991)" target="_blank">Mathematics Subject Classification (1991)  11B37
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号