Mathematical Sciences: Faculty Presentations (1991-2022)

Introduction to Superpatterns

Document Type

Presentation

Presentation Date

10-2-2015

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.

Abstract or Description

In the Combinatorics of permutations, patterns describe how a smaller permutation can be 'contained' in a larger permutation. There has been an explosion of research papers in permutation patterns since it was first defined by Donald Knuth in 1968. Within the realm of permutation patterns is a relatively new topic called the superpattern problem, which asks, "If P is a set of permutations, what is the smallest n such that there exists a permutation of length n which contains every element of P as a pattern?" In this talk, we will detail some known results on the superpattern problem and explore some variations to this question.

Sponsorship/Conference/Institution

Georgia Southern University Mathematics Colloquium

Location

Statesboro, GA

Link to Full Text

Share

COinS