Zonshen Yu
Two-way Superpatterns
Authors
Miklós Bóna, Zonshen Yu
Mentor
Dr. Miklós Bóna
College
College of Liberal Arts and Sciences
Abstract
<p>The concept of n-superpatterns, a permutation A which contains all patterns of length n, and many variations have been extensively studied. We introduce another variation, that of a two-way n-superpattern, which is a permutation A such that all patterns of length n are either contained in A or the reverse of A. We present a construction of a two-way n-superpattern using n*ceiling(n/2) – ceiling(n/2)*(ceiling(n/2)-1)/2 entries and compare our construction to the lengths of known two-way n-superpatterns for small n. We then connect this to the best known bounds for the shortest possible length of a n-superpattern, and investigate relationships between two-way n-superpatterns, n-superpatterns, and n-1-superpatterns.</p>
Poster
Hover over the image below to zoom in or click to view full screen.
Research Pitch
View a 3-minute research pitch below.
To comment below, please sign in with Facebook or Google (using your ufl account) by clicking the little round icons to the right. If you decide, you can post as a guest by entering name and email below, but will lose some features. You can also subscribe to the student’s page to get email updates on new comments.