Complex Moment Problems and Recursive Relations of Fibonacci Type

被引:0
|
作者
Rajae Ben Taher
Mustapha Rachidi
机构
[1] Université Moulay Ismail,Département de Mathématiques et Informatique, Faculté des Sciences
[2] Académie de Reims,undefined
[3] Mathematics Section - LEGT - F. Arago,undefined
来源
关键词
Primary 40A25; Secondary 44A60, 45M05 15A48, 47A57; Truncated complex moment problem; representing measure; flatness; moment matrix; Fibonacci recursive relation; constructive process;
D O I
暂无
中图分类号
学科分类号
摘要
The complex moment problem for a sequence γ(2n) = {γij}0≤i,j≤n has been studied by Curto-Fialkow, where positivity and extension properties of the moment matrix M(n) = M(n)(γ) (γ ≡ γ(2n)) are involved, for guaranteeing the existence of representing measure. But it was showed that positivity and recursiveness are not sufficient in order to have a representing measure for γ. Here we combine our techniques based on the Fibonacci sequences’s properties with some Curto-Fialkow’s results to obtain sufficient conditions for insuring that γ is a truncated moment sequence. We focus ourself on the case when rank M(n) ≤ n + 1, and finally we stretch our exploration to the finite-rank infinite positive moment matrix.
引用
下载
收藏
页码:307 / 318
页数:11
相关论文
共 50 条