Results 1  10
of
33
N Pcompleteness of generalized multi Skolem sequences
"... A Skolem sequence is a sequence a1,a2,...,a2n (where ai ∈ A = {1,...,n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The existence question of deciding which sets ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A Skolem sequence is a sequence a1,a2,...,a2n (where ai ∈ A = {1,...,n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The existence question of deciding which sets
Extending Skolem sequences, how can you begin?
"... For each n ≥ 1and1≤j ≤ n we show the existence of an extended Skolem sequence of order n starting with the symbol j. 1 ..."
Abstract
 Add to MetaCart
For each n ≥ 1and1≤j ≤ n we show the existence of an extended Skolem sequence of order n starting with the symbol j. 1
The Intersection Spectrum of Skolem Sequences and its Applications to λFold Cyclic Triple Systems
, 2014
"... ar ..."
Indecomposable Skolem and Rosa sequences
 Australasian J. Combin
"... We introduce indecomposable (hooked) Skolem sequences and we show their existence for all admissible orders. We then introduce a new construction for twofold triple systems from twofold Skolem sequences, and use this to motivate the concept of a twofold Rosa sequence, whose existence we show for ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We introduce indecomposable (hooked) Skolem sequences and we show their existence for all admissible orders. We then introduce a new construction for twofold triple systems from twofold Skolem sequences, and use this to motivate the concept of a twofold Rosa sequence, whose existence we show
Exponential lower bounds for the numbers of Skolemtype sequences
"... This is a preprint of an article accepted for publication in Ars Combinatoria c○2003 (copyright owner as specified in the journal). It was shown by Abrham that the number of pure Skolem sequences of order n, n ≡ 0 or 1 (mod 4), and the number of extended Skolem sequences of order n, are both bounded ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This is a preprint of an article accepted for publication in Ars Combinatoria c○2003 (copyright owner as specified in the journal). It was shown by Abrham that the number of pure Skolem sequences of order n, n ≡ 0 or 1 (mod 4), and the number of extended Skolem sequences of order n, are both
A NOTE ON THE HARDNESS OF SKOLEMTYPE SEQUENCES
"... Abstract. The purpose of this note is to give upper bounds (assuming P different from NP) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the existence question. We prove that the existence questions for both multi Skolem sequences and generalized Skolem ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. The purpose of this note is to give upper bounds (assuming P different from NP) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the existence question. We prove that the existence questions for both multi Skolem sequences and generalized
Perfect Skolem sets
"... A Skolem sequence is a sequence s1, s2,..., s2n (where si ∈ A = {1... n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The problem of deciding which sets of the for ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A Skolem sequence is a sequence s1, s2,..., s2n (where si ∈ A = {1... n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The problem of deciding which sets
The Existence of Two New Classes of NearSkolem Type Sequences
"... Let m,n be two positive integers, m ≤ n. An mnearSkolem sequence of order n and defect m is a sequence m − Sn = (s1, s2, · · · , s2n−2) of 2n − 2 nonnegative integers such that the following conditions hold: 1. for each k ∈ {1, 2, · · ·,m−1,m+1, · · · , n} there exist exactly two element ..."
Abstract
 Add to MetaCart
Let m,n be two positive integers, m ≤ n. An mnearSkolem sequence of order n and defect m is a sequence m − Sn = (s1, s2, · · · , s2n−2) of 2n − 2 nonnegative integers such that the following conditions hold: 1. for each k ∈ {1, 2, · · ·,m−1,m+1, · · · , n} there exist exactly two
A SkolemMahlerLech theorem in positive characteristic . . .
, 2005
"... Lech proved in 1953 that the set of zeroes of a linear recurrence sequence in a field of characteristic 0 is the union of a finite set and finitely many infinite arithmetic progressions. This result is known as the SkolemMahlerLech theorem. Lech gave a counterexample to a similar statement in pos ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Lech proved in 1953 that the set of zeroes of a linear recurrence sequence in a field of characteristic 0 is the union of a finite set and finitely many infinite arithmetic progressions. This result is known as the SkolemMahlerLech theorem. Lech gave a counterexample to a similar statement
A EUCLIDEAN SKOLEMMAHLERLECHCHABAUTY METHOD
"... ABSTRACT. Using the theory of ominimality we show that the padic method of SkolemMahlerLechChabauty may be adapted to prove instances of the dynamical MordellLang conjecture for some real analytic dynamical systems. For example, we show that if f1,..., fn is a finite sequence of real analytic ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
ABSTRACT. Using the theory of ominimality we show that the padic method of SkolemMahlerLechChabauty may be adapted to prove instances of the dynamical MordellLang conjecture for some real analytic dynamical systems. For example, we show that if f1,..., fn is a finite sequence of real analytic
Results 1  10
of
33