关于过山车排列结构的一个注记
A Note on the Structure of Roller Coaster Permutations
摘要：
我们考虑Ahmed和Snevily[1]提出的过山车排列的结构。过山车排列被描述为使该排列及其所有子排列同时从上升到下降或从下降到上升的总切换最大化的排列。本文着眼于这些排列的交替结构，然后我们引入一个概念的条件强于交替的排列，我们将称为递归交替。我们还研究了哪些条目可以出现在排列中的偶数，奇数和结束位置的优先级。
英文摘要：
We consider the structure of roller coaster permutations as introduced by Ahmed & Snevily[1]. A roller coaster permutation is described as a permuta- tion that maximizes the total switches from ascending to descending or visa versa for the permutation and all of its subpermutations simultaneously. This paper looks at the alternating structure of these permutations and then we introduce a notion of a condition stronger than alternating for a permutation that we shall refer to as recursively alternating. We also examine the behav- ior of what entries can show up in even, odd, and end positions within the permutations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
