Linear recursive sequences (Q1084123): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0196-8858(86)90034-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033270528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Krylov subspace methods, biorthogonal polynomials and Padé-type approximants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749893 / rank
 
Normal rank

Latest revision as of 17:26, 17 June 2024

scientific article
Language Label Description Also known as
English
Linear recursive sequences
scientific article

    Statements

    Linear recursive sequences (English)
    0 references
    1986
    0 references
    The author explains how to use the theory of symmetric polynomials for linear recursive sequences. As examples, short proofs of well known results on the Fibonacci numbers of order \(k\) and on the Lucas numbers are given.
    0 references
    symmetric polynomials
    0 references
    linear recursive sequences
    0 references
    Fibonacci numbers of order k
    0 references
    Lucas numbers
    0 references
    0 references

    Identifiers