Results 11 to 20 of about 1,635,411 (70)
The Continuous Skolem-Pisot Problem [PDF]
We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence.
Jean-Charles Delvenne (331195) +13 more
core +9 more sources
The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros of a linear recurrence sequence is the union of a finite set and finitely many arithmetic progressions. The corresponding computational question, the Skolem Problem, asks to determine
Worrell, J +17 more
core +1 more source
It is a longstanding open problem whether there is an algorithm to decide the Skolem Problem for linear recurrence sequences, namely whether a given such sequence has a zero term.
James Worrell +5 more
core +1 more source
A Universal Skolem Set of Positive Lower Density [PDF]
The Skolem Problem asks to decide whether a given integer linear recurrence sequence (LRS) has a zero term. Decidability of this problem has been open for many decades, with little progress since the 1980s.
Worrell, J. +5 more
core +1 more source
Solution of a Conjecture on Skolem Mean Graph [PDF]
A paper treating about Smarandachely super m-mean graph, skolem mean labeling, Skolem mean graph ...
Balaji, V.
core +1 more source
Skolem Number of Subgraphs on the Triangular Lattice [PDF]
A Skolem sequence can be thought of as a labelled path where any two vertices with the same label are that distance apart. This concept has naturally been generalized to graph labelling.
Carrigan, Braxton, Green, Garrett
core +1 more source
Skolem Meets Bateman-Horn [PDF]
The Skolem Problem asks to determine whether a given integer linearrecurrence sequence has a zero term. This problem arises across a wide range oftopics in computer science, including loop termination, (weighted) automatatheory, and the analysis of ...
Worrell, J. +4 more
core +1 more source
Skolem Number of Cycles and Grid Graphs [PDF]
A Skolem sequence can be thought of as a labelled path where two vertices with the same label are that distance apart. This concept has naturally been generalized to labellings of other graphs, but always using at most two of any integer label.
Asplund, John +4 more
core +1 more source
On the Skolem Problem for Reversible Sequences [PDF]
Given an integer linear recurrence sequence $\langle X_n \rangle_n$, the Skolem Problem asks to determine whether there is a natural number $n$ such that $X_n = 0$.
Kenison, George
core +1 more source
Disjoint skolem-type sequences and applications [PDF]
Let D = {i₁, i₂,..., in} be a set of n positive integers. A Skolem-type sequence of order n is a sequence of i such that every i ∈ D appears exactly twice in the sequence at position aᵢ and bᵢ, and |bᵢ - aᵢ| = i.
Alghamdi, Naeemah
core +1 more source

