Open Access. Powered by Scholars. Published by Universities.®

Discrete Mathematics and Combinatorics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Discrete Mathematics and Combinatorics

Distribution Of Permutation Statistics Across Pattern Avoidance Classes, And The Search For A Denert-Associated Condition Equivalent To Pattern Avoidance, Joshua Thomas Agustin Davies Jan 2017

Distribution Of Permutation Statistics Across Pattern Avoidance Classes, And The Search For A Denert-Associated Condition Equivalent To Pattern Avoidance, Joshua Thomas Agustin Davies

Dissertations, Master's Theses and Master's Reports

We begin with a discussion of the symmetricity of $\maj$ over $\des$ in pattern avoidance classes, and its relationship to $\maj$-Wilf equivalence. From this, we explore the distribution of permutation statistics across pattern avoidance for patterns of length 3 and 4.

We then begin discussion of Han's bijection, a bijection on permutations which sends the major index to Denert's statistic and the descent number to the (strong) excedance number. We show the existence of several infinite families of fixed points for Han's bijection.

Finally, we discuss the image of pattern avoidance classes under Han's bijection, for the purpose of finding …


Pattern Containment In Circular Permutations, Charles Lanning Jan 2017

Pattern Containment In Circular Permutations, Charles Lanning

Electronic Theses and Dissertations

Pattern containment in permutations, as opposed to pattern avoidance, involves two aspects. The first is to contain every pattern at least once from a given set, known as finding superpatterns; while the second is to contain some given pattern as many times as possible, known as pattern packing. In this thesis, we explore these two questions in circular permutations and present some interesting observations. We also raise some questions and propose some directions for future study.