论文标题
鱼潮树
Fishburn trees
论文作者
论文摘要
在有限集合上，二进制树之间的二进制树之间的自然对应关系具有自然的对应关系。通过适当限制顶点标签，我们到达了一类我们称为鱼潮树的树木。我们在Fishburn burn数量计算的鱼潮树和其他众所周知的组合结构之间进行了射击，并通过组成这些新的地图，我们获得了一些已知地图的简化版本。最后，我们将这种新机械应用于所谓的翻转和总和问题，并在修改后的上升序列上。
The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call Fishburn trees. We give bijections between Fishburn trees and other well-known combinatorial structures that are counted by the Fishburn numbers, and by composing these new maps we obtain simplified versions of some of the known maps. Finally, we apply this new machinery to the so called flip and sum problems on modified ascent sequences.
