Perfect Skolem sets

Details Perfect Skolem sets Perfect Skolem sets

2005-06-08

arxiv.org/abs/math/0506155v1

Mathematics

Combinatorics

Scientific paper

A Skolem sequence is a sequence a_1,a_2,...,a_2n (where a_i \in A = {1,...,n }), each a_i occurs exactly twice in the sequence and the two occurrences are exactly a_i 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 form A = {1,...,n} are Skolem sets was solved by Thoralf Skolem in the late 1950's. We study the natural generalization where A is allowed to be any set of n positive integers. We give necessary conditions for the existence of Skolem sets of this generalized form. We conjecture these necessary conditions to be sufficient, and give computational evidence in favor of our conjecture. We investigate special cases of the conjecture and prove that the conjecture hold for some of them. We also study enumerative questions and show that this problem has strong connections with problems related to permutation displacements.

Affiliated with

Also associated with

No associations

Rating

Perfect Skolem sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Perfect Skolem sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perfect Skolem sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-170575