A comparison of algorithms for proving positivity of linearly recurrent sequences (Q2109988)

From MaRDI portal
Revision as of 04:12, 31 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A comparison of algorithms for proving positivity of linearly recurrent sequences
scientific article

    Statements

    title
    A comparison of algorithms for proving positivity of linearly recurrent sequences (English)
    0 references
    author
    Philipp Nuspl
    0 references
    Veronika Pillwein
    0 references
    publication date
    21 December 2022
    0 references
    zbMATH Keywords
    difference equations
    0 references
    inequalities
    0 references
    holonomic sequences
    0 references
    describes a project that uses
    QEPCAD
    0 references
    GeneratingFunctions
    0 references
    DLMF
    0 references
    SageMath
    0 references
    SumCracker
    0 references
    OEIS
    0 references
    Arb
    0 references
    cites work
    QEPCAD B
    0 references
    Q4079605
    0 references
    Q4421931
    0 references
    Q3671245
    0 references
    Q4236280
    0 references
    Q5149828
    0 references
    Q4227278
    0 references

    Identifiers

    zbMATH DE Number
    7635703
    0 references
    OpenAlex ID
    W4299831618
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2109988&oldid=37474260"
    Powered by MediaWiki