Roller Coaster Permutations and Partition Numbers

arXiv1703.08735MaRDI QIDQ6284796FDOQ6284796

Authors: William Adamczak, Jacob Boni 

Publication date: 25 March 2017

Abstract: This paper explores the properties of partitions of roller coaster permutations. A roller coaster permutation is a permutation the alternates between increasing and decreasing a maximum number of times, while its subsequences also alternate between increasing and decreasing a maximum number of times simultaneously. The focus of this paper is on achieving an upper bound for the partition number of a roller coaster permutation of length $n$.

This page was built for publication: Roller Coaster Permutations and Partition Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284796)