Mathematical Sciences: Faculty Presentations (1991-2022)

Plane Binary Trees and Superpatterns for Layered Permutations

Document Type

Presentation

Presentation Date

3-5-2016

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

Let P be a set of permutation patterns. If τ is a permutation that contains every element of P as a pattern, then we say that τ is a P -superpattern. Since Arratia coined the term in 1999, there have been several investigations into the length of the shortest Sk-superpattern, where Sk is the set of permutations of length k. Here, we will construct superpatterns for layered permutations of length k and explore an interesting connection between this set of superpatterns and plane binary trees on k vertices.

Sponsorship/Conference/Institution

Spring Southeastern Sectional Meeting of the American Mathematical Society (AMS)

Location

Athens, GA

Link to Full Text

Share

COinS