A pinnacle of a permutation is a value that is larger than its immediate neighbors when written in one-line notation. In this paper, we build on previous work that characterized admissible pinnacle sets of permutations. For these sets, there can be specific orderings of the pinnacles that are not admissible, meaning that they are not realized by any permutation. Here we characterize admissible orderings, using the relationship between a pinnacle x and its rank in the pinnacle set to bound the number of times that the pinnacles less than or equal to x can be interrupted by larger values.

中文翻译：

---

可接受的品尼高订购

当以单行表示法书写时，排列的顶峰是一个比其直接邻居大的值。在本文中，我们以先前的工作为基础，这些工作表征了排列的容许顶点集合。对于这些集合，可能存在不允许的顶峰特定顺序，这意味着它们无法通过任何排列来实现。在这里，我们使用顶峰x及其在顶峰中的等级之间的关系来表征可接受的排序，以限制小于或等于x的顶峰可以被较大值中断的次数。