@InProceedings{   OuaknineWorrell:ICALP:2014,
  Author        = {Ouaknine, Jo{\"e}l and Worrell, James},
  Editor        = "Esparza, Javier and Fraigniaud, Pierre and Husfeldt, Thore and Koutsoupias, Elias",
  Abstract      = "Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem asks whether all terms of the sequence are positive. We show that, for simple LRS (those whose characteristic polynomial has no repeated roots) of order 9 or less, Positivity is decidable, with complexity in the Counting Hierarchy.",
  Address       = "Berlin, Heidelberg",
  BookTitle     = "Automata, Languages, and Programming",
  date-added    = "2022-01-27 10:38:08 +0100",
  date-modified = "2023-08-21 15:48:39 +0200",
  ISBN          = "978-3-662-43951-7",
  Pages         = "318--329",
  Publisher     = "Springer Berlin Heidelberg",
  Title         = "On the Positivity Problem for Simple Linear Recurrence Sequences",
  Year          = "2014"
}

@InProceedings{ OuaknineWorrell:ICALP:2014, Author = {Ouaknine, Jo{\"e}l and Worrell, James}, Editor = "Esparza, Javier and Fraigniaud, Pierre and Husfeldt, Thore and Koutsoupias, Elias", Abstract = "Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem asks whether all terms of the sequence are positive. We show that, for simple LRS (those whose characteristic polynomial has no repeated roots) of order 9 or less, Positivity is decidable, with complexity in the Counting Hierarchy.", Address = "Berlin, Heidelberg", BookTitle = "Automata, Languages, and Programming", date-added = "2022-01-27 10:38:08 +0100", date-modified = "2023-08-21 15:48:39 +0200", ISBN = "978-3-662-43951-7", Pages = "318--329", Publisher = "Springer Berlin Heidelberg", Title = "On the Positivity Problem for Simple Linear Recurrence Sequences", Year = "2014" }

Library Size: 13G (12941 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge