<div class="csl-bib-body">
<div class="csl-entry">Kenison, G. (2022). On the Skolem Problem for Reversible Sequences. In <i>47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)</i> (pp. 61:1-61:15). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2022.61</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/101800
-
dc.description.abstract
Given an integer linear recurrence sequence (Xn)∞ n=0, the Skolem Problem asks to determine whether there is an n ϵ N0 such that Xn = 0. Recent work by Lipton, Luca, Nieuwveld, Ouaknine, Purser, and Worrell proved that the Skolem Problem is decidable for a class of reversible sequences of order at most seven. Here we give an alternative proof of their result. Our novel approach employs a powerful result for Galois conjugates that lie on two concentric circles due to Dubickas and Smyth.
en
dc.description.sponsorship
European Commission
-
dc.description.sponsorship
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
-
dc.language.iso
en
-
dc.subject
Linear Recurrences
-
dc.subject
The Skolem Problem
-
dc.subject
Verification
-
dc.title
On the Skolem Problem for Reversible Sequences
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.relation.isbn
978-3-95977-256-3
-
dc.description.startpage
61:1
-
dc.description.endpage
61:15
-
dc.relation.grantno
ERC Consolidator Grant 2020
-
dc.relation.grantno
ICT19-018
-
dc.type.category
Full-Paper Contribution
-
tuw.booktitle
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
-
tuw.container.volume
241
-
tuw.relation.publisher
Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
-
tuw.project.title
Automated Reasoning with Theories and Induction for Software Technologies
-
tuw.project.title
Distribution Recovery for Invariant Generation of Probabilistic Programs
-
tuw.researchTopic.id
C4
-
tuw.researchTopic.name
Mathematical and Algorithmic Foundations
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-04 - Forschungsbereich Formal Methods in Systems Engineering
-
tuw.publisher.doi
10.4230/LIPIcs.MFCS.2022.61
-
dc.description.numberOfPages
15
-
tuw.event.name
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
en
tuw.event.startdate
22-08-2022
-
tuw.event.enddate
26-08-2022
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Vienna
-
tuw.event.country
AT
-
tuw.event.presenter
Kenison, George
-
tuw.event.track
Multi Track
-
wb.sciencebranch
Informatik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.value
100
-
item.languageiso639-1
en
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
item.fulltext
no Fulltext
-
item.openairetype
conference paper
-
item.grantfulltext
none
-
item.cerifentitytype
Publications
-
crisitem.project.funder
European Commission
-
crisitem.project.funder
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
-
crisitem.project.grantno
ERC Consolidator Grant 2020
-
crisitem.project.grantno
ICT19-018
-
crisitem.author.dept
E192-04 - Forschungsbereich Formal Methods in Systems Engineering