Analyzing ultimate positivity for solvable systems (Q897909): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Cylindrical Algebraic Decomposition I: The Basic Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The continuous Skolem-Pisot problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The presence of a zero in an integer linear recurrent sequence is NP-hard to decide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and algebraic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positivity of second order linear recurrent sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the Skolem-Mahler-Lech theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When can we detect that a P-finite sequence is positive? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positivity of third order linear recurrence sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on recurring series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3697106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Positivity Problem for Simple Linear Recurrence Sequences, / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positivity Problems for Low-Order Linear Recurrence Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barrier certificates for nonlinear model validation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all polynomial invariants in simple loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transcendental Numbers. (AM-16) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Occurrence of zero in a linear recursive sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: TERMINATION ANALYSIS OF LINEAR LOOPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic termination analysis of solvable loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decidable results on reachability of solvable systems / rank
 
Normal rank

Revision as of 03:46, 11 July 2024

scientific article
Language Label Description Also known as
English
Analyzing ultimate positivity for solvable systems
scientific article

    Statements

    Analyzing ultimate positivity for solvable systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    positivity problem
    0 references
    dynamical system
    0 references
    decision procedure
    0 references
    computational algebraic geometry
    0 references
    number theory
    0 references
    0 references
    0 references

    Identifiers