A Note on the Structure of Roller Coaster Permutations


  •  William Adamczak    

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.


This work is licensed under a Creative Commons Attribution 4.0 License.
  • ISSN(Print): 1916-9795
  • ISSN(Online): 1916-9809
  • Started: 2009
  • Frequency: bimonthly

Journal Metrics

  • h-index (February 2019): 18
  • i10-index (February 2019): 48
  • h5-index (February 2019): 7
  • h5-median (February 2019): 10

( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )

Contact