Title: | Skolem, Langford, Extended, and Near-Skolem Sequences, Oh My! |

Speaker: | Heather Jordon Associate Editor Mathematical Reviews Ann Arbor, MI |

Abstract: | A Skolem sequence of order $t$ is a sequence $2t$ integers such that each integer between 1 and $t$ appears twice and two instances of the integer $k$ are $k$ apart. For example, 5242354311 is a Skolem sequence of order 5. These sequences, and their generalizations, are very interesting from a combinatorial point of view and have many applications. In this talk, we will discuss Skolem sequences and some generalizations: extended, Langford, and near-Skolem sequences. We will also discuss a few applications of these sequences, including integer partitioning and graph decompositions. |

Location: | Palenske 227 |

Date: | 11/1/2012 |

Time: | 3:30 PM |

@abstract{MCS:Colloquium:HeatherJordon:2012:11:1, author = "{Heather Jordon}", title = "{Skolem, Langford, Extended, and Near-Skolem Sequences, Oh My!}", address = "{Albion College Mathematics and Computer Science Colloquium}", month = "{1 November}", year = "{2012}" }