Perfect Skolem sets
2007; Elsevier BV; Volume: 308; Issue: 9 Linguagem: Inglês
10.1016/j.disc.2006.12.003
ISSN1872-681X
Autores Tópico(s)Digital Image Processing Techniques
ResumoA Skolem sequence is a sequence s 1 , s 2 , … , s 2 n (where s i ∈ A = { 1 , … , n } ) , each s i occurs exactly twice in the sequence and the two occurrences are exactly s 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 1950s. 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 holds for some of them. We also study enumerative questions and show that this problem has strong connections with problems related to permutation displacements.
Referência(s)