Abstract
Abstract Let D be a set of positive integers. A Skolem-type sequence is a sequence of i ∈ D such that every i ∈ D appears exactly twice in the sequence at positions a i and b i, and |b i − a i| = i. These sequences might contain empty positions, which are filled with null elements. Thoralf A. Skolem defined and studied Skolem sequences in order to generate solutions to Heffter’s difference problems. Later, Skolem sequences were generalized in many ways to suit constructions of different combinatorial designs. Alexander Rosa made the use of these generalizations into a fine art. Here we give a survey of Skolem-type sequences and their applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
