2017
DOI: 10.1016/j.jnt.2016.09.025
|View full text |Cite
|
Sign up to set email alerts
|

Generalized Vandermonde determinants and characterization of divisibility sequences

Abstract: We present a different proof of the characterization of non-degenerate recurrence sequences, which are also divisibility sequences, given by Van der Poorten, Bezevin, and Pethö in their paper [1]. Our proof is based on an interesting determinant identity related to impulse sequences, arising from the evaluation of a generalized Vandermonde determinant. As a consequence of this new proof we can find a more precise form for the resultant sequence presented in [1], in the general case of non-degenerate divisibili… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
2
1
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 5 publications
(13 reference statements)
0
6
0
Order By: Relevance
“…by Proposition 2, which is the main theorem of Bézivin et al [5]. (Our proof is a modification of Barbero [3], which is substantially easier than the proof in [5]. )…”
Section: Vandermonde Type Determinantsmentioning
confidence: 83%
See 1 more Smart Citation
“…by Proposition 2, which is the main theorem of Bézivin et al [5]. (Our proof is a modification of Barbero [3], which is substantially easier than the proof in [5]. )…”
Section: Vandermonde Type Determinantsmentioning
confidence: 83%
“…If there are characteristic roots α i = α j such that α i /α j is a root of unity then (u n ) n≥0 is degenerate. 3 Much more important for our considerations is the period M of the linear recurrence sequence (u n ) n≥0 which is defined to be the smallest positive integer such that whenever α e 1 1 • • • α em m (each e i ∈ Z) is a root of unity, it is an Mth root of unity. 4 Thus if (u n ) n≥0 is degenerate then M > 1.…”
mentioning
confidence: 99%
“…See [2] and [4]. In other words, there exist a sequence c = (c n ) ∞ n=0 such that b n = a n c n , for any index n.…”
Section: Standard Linear Divisibility Sequencesmentioning
confidence: 99%
“…We now prove that S(2) is also true. It is easy to see that gcd 2 . This implies that r(x) divides α 2 g(x)(G * k (x)) 2 .…”
Section: Characterization Of the Strong Divisibility Propertymentioning
confidence: 99%
“…In 2005 Rayes, et al [24] proved that the strong divisibility property holds partially for the Chebyshev polynomials (we prove the general result in Theorem 5.6). Over the years several other authors [2,3,8,16,17,18,20,21,22,23,25] have also been interested in the divisibility properties of sequences.…”
Section: Introductionmentioning
confidence: 99%