数学
多重性(数学)
零(语言学)
组合数学
整数(计算机科学)
订单(交换)
单一制国家
数学分析
财务
政治学
计算机科学
语言学
哲学
经济
程序设计语言
法学
作者
Carlos A. Gómez,Florian Luca
标识
DOI:10.1142/s1793042119500301
摘要
We consider a family of linear recurrence sequences [Formula: see text] of order [Formula: see text] whose first [Formula: see text] terms are [Formula: see text] and each term afterwards is the sum of the preceding [Formula: see text] terms. In this paper, we study the zero–multiplicity on [Formula: see text] when the indices are extended to all integers. In particular, we give a upper bound (dependent on [Formula: see text]) for the largest positive integer [Formula: see text] such that [Formula: see text] and show that [Formula: see text] has zero–multiplicity unitary when the indices are extended to all the integers.
科研通智能强力驱动
Strongly Powered by AbleSci AI