Results 1 to 10 of about 1,558,342 (70)

Hooked k-extended Skolem sequences [PDF]

Discrete Mathematics, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Václav Linek, Zhike Jiang
exaly   +5 more sources

The existence of near-Skolem and hooked near-Skolem sequences

Discrete Mathematics, 1994
The author has studied the near-Skolem and hooked near-Skolem sequences and it is proved that the arithmetic necessary conditions for the existence of near-Skolem and hooked near-Skolem sequences are also sufficient. These sequences are defined by the following: Let \(m\), \(n\) be integers, \(m\leq n\).
Nabil Shalaby
openaire   +3 more sources

The intersection spectrum of hooked Skolem sequences and applications

Discrete Applied Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nabil Shalaby, Daniela Silvesan
openaire   +5 more sources

Skolem Meets Schanuel [PDF]

, 2022
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, Nieuwveld, Joris, Worrell, James, Luca, Florian, Luca, F, Bilu, Yuri, Luca, F., Purser, D, Nieuwveld, J., Purser, D., Nieuwveld, J, Worrell, J., Ouaknine, J, Ouaknine, J., Bilu, Y., Ouaknine, Joël, Purser, David, Bilu, Y   +17 more
core   +1 more source

Skolem Meets Bateman-Horn [PDF]

, 2023
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., Maynard, J., Noubissie, A., Ouaknine, J., Luca, F.   +4 more
core   +1 more source

On the Skolem problem and the Skolem conjecture [PDF]

, 2022
It is a longstanding open problem whether there is an algorithm to decide the Skolem Problem for linear recurrence sequences (LRS) over the integers, namely whether a given such sequence has a zero term (i.e., whether un = 0 for some n).
James Worrell, Worrell, J, Nieuwveld, Joris, Worrell, James, Luca, Florian, Joris Nieuwveld, Ouaknine, Joel, Luca, F, Luca, F., Lipton, RJ, Purser, D, Florian Luca, Nieuwveld, J., Joël Ouaknine, Purser, D., Nieuwveld, J, Lipton, R., Worrell, J., Ouaknine, J, Richard Lipton, Ouaknine, J., David Purser, Lipton, Richard J, Purser, David   +23 more
core   +1 more source

Solution of a Conjecture on Skolem Mean Graph [PDF]

, 2011
A paper treating about Smarandachely super m-mean graph, skolem mean labeling, Skolem mean graph ...
Balaji, V.
core   +1 more source

A Universal Skolem Set of Positive Lower Density [PDF]

, 2022
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., Worrell, James, Ouaknine, J., Luca, Florian, Ouaknine, Joël, Luca, F.   +5 more
core   +1 more source

Skolem Number of Cycles and Grid Graphs [PDF]

, 2021
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, Carrigan, Braxton, Braxton Carrigan, John Asplund   +3 more
core   +1 more source

On the Beta-Number of Forests with Isomorphic Components

Discussiones Mathematicae Graph Theory, 2018
The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1, . . .
Ichishima Rikio, López Susana-Clara, Muntaner-Batle Francesc Antoni, Oshima Akito   +3 more
doaj   +1 more source