Further Results on Pinnacle Sets

The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis, Nelson, Petersen, and Tenner and also results proven recently by...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-11
Main Author: Minnich, Quinn
Format: Article
Language:English
Subjects:
Combinatorial analysis
Permutations
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis, Nelson, Petersen, and Tenner and also results proven recently by Fang, this paper aims to add to our understanding of pinnacle sets. In particular, we give a simpler and more combinatorial proof of a weighted sum formula previously proven by Fang. Additionally, we give a recursion for counting the admissible orderings of the elements of a potential pinnacle set. Finally, we give another way of viewing pinnacle sets that sheds light on their structure and also yields a recursion for counting the number of permutations with that pinnacle set.
ISSN:2331-8422