A Note on the Structure of Roller Coaster Permutations

William Adamczak

Journal of Mathematics Research, 2017, vol. 9, issue 3, 75-79

Abstract: In this paper we consider the structure of a special class of permutations known as roller coaster permutations, first introduced by Ahmed \& Snevily (2013). A roller coaster permutation is described as, a permutation that maximizes the total switches from ascending to descending, or visa versa, for the permutation as well as all of its subpermutations, simultaneously. This paper looks at the structure of these permutations, particularly the alternating structure, what the entires of these permutations can look like, we then introduce a notion of a condition stronger than alternating that we shall refer to as recursively alternating.

Keywords: permutations; combinatorics (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.ccsenet.org/journal/index.php/jmr/article/view/68427/37113 (application/pdf)
http://www.ccsenet.org/journal/index.php/jmr/article/view/68427 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:jmrjnl:v:9:y:2017:i:3:p:75-79

Access Statistics for this article

More articles in Journal of Mathematics Research from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().