On explicit formulae and linear recurrent sequences

MaRDI QIDQ3092568zbMATH OpenFDO

Authors Luis Gallardo, Reinhardt Euler

Publication date 20 September 2011

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Euclidean divisioneven characteristicfinite fieldspolynomials

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)

Recommendations

• scientific article; zbMATH DE number 3865368
• scientific article; zbMATH DE number 1408136
• A note on recurrence sequences.
• scientific article; zbMATH DE number 895315
• The Fibonacci polynomials in rings.

Cited in

(11)

• Recurrence formulas for permanents of (0,1)-circulants
• Recurrent sequences and affine functional equations
• Jordan forms and \(n\)th order linear recurrences
• An algorithm for proving arbitrary identities involving linear recurrence sequences
• On linear recurrence relations satisfied by Pisot sequences
• scientific article; zbMATH DE number 5778103 (Why is no real title available?)
• scientific article; zbMATH DE number 7008842 (Why is no real title available?)
• scientific article; zbMATH DE number 2145150 (Why is no real title available?)
• scientific article; zbMATH DE number 3448647 (Why is no real title available?)
• On a binary recurrent sequence of polynomials
• scientific article; zbMATH DE number 5032187 (Why is no real title available?)

This page was built for publication: On explicit formulae and linear recurrent sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092568)